✦ LIBER ✦

Universal Graphs without Large Cliques

✍ Scribed by P. Komjath; S. Shelah

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 455 KB
Volume: 63
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Disjoint clique cutsets in graphs withou

Disjoint clique cutsets in graphs without long holes

✍ Elaine M. Eschen; Chính T. Hoàng; Mark D. T. Petrick; R. Sritharan 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB

## Abstract A biclique cutset is a cutset that induces the disjoint union of two cliques. A hole is an induced cycle with at least five vertices. A graph is biclique separable if it has no holes and each induced subgraph that is not a clique contains a clique cutset or a biclique cutset. The class

Minor-universal planar graphs without ac

Minor-universal planar graphs without accumulation points

✍ Daniela Kühn 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 76 KB 👁 1 views

Finding a large hidden clique in a rando

Finding a large hidden clique in a random graph

✍ Noga Alon; Michael Krivelevich; Benny Sudakov 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

We consider the following probabilistic model of a graph on n labeled vertices. ## Ž . First choose a random graph G n, 1r2 , and then choose randomly a subset Q of vertices of size k and force it to be a clique by joining every pair of vertices of Q by an edge. The problem is to give a polynomia

Finding and certifying a large hidden cl

Finding and certifying a large hidden clique in a semirandom graph

✍ Uriel Feige; Robert Krauthgamer 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

designed an algorithm based on spectral techniques that almost surely finds a clique of size √ n hidden in an otherwise random graph. We show that a different algorithm, based on the Lovász theta function, almost surely both finds the hidden clique and certifies its optimality. Our algorithm has an

On the Ramsey number of trees versus gra

On the Ramsey number of trees versus graphs with large clique number

✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 335 KB

Chvatal established that r(T,, K,,) = (m -1 ) ( n -1 ) + 1, where T, , , is an arbitrary tree of order m and K, is the complete graph of order n. This result was extended by Chartrand, Gould, and Polimeni who showed K, could be replaced by a graph with clique number n and order n + 5 provided n 2 3

Edge disjoint Steiner trees in graphs wi

Edge disjoint Steiner trees in graphs without large bridges

✍ Matthias Kriesell 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

## Abstract A set __A__ of vertices of an undirected graph __G__ is called __k__‐__edge‐connected in G__ if for all pairs of distinct vertices __a, b__∈__A__, there exist __k__ edge disjoint __a, b__‐paths in __G__. An __A__‐__tree__ is a subtree of __G__ containing __A__, and an __A__‐__bridge__ i