✦ LIBER ✦

Embeddings and Ramsey numbers of sparseκ-uniform hypergraphs

✍ Scribed by Oliver Cooley; Nikolaos Fountoulakis; Daniela Kühn; Deryk Osthus

Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 778 KB
Volume: 29
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-009-2356-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of connected sparsely edged u

The number of connected sparsely edged uniform hypergraphs

✍ Michakl Karoński; Tomasz kLuczak 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 684 KB

Certain families of d-uniform hypergraphs are counted. In particular, the number of connected d-uniform hypergraphs with r vertices and r + k hyperedges, where k = o(log r/log tog r), is found.

Linear Ramsey numbers of sparse graphs

✍ Lingsheng Shi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

## Abstract The Ramsey number __R__(__G__~1~,__G__~2~) of two graphs __G__~1~ and __G__~2~ is the least integer __p__ so that either a graph __G__ of order __p__ contains a copy of __G__~1~ or its complement __G__^c^ contains a copy of __G__~2~. In 1973, Burr and Erdős offered a total of $25 for se

New Lower Bounds for Ramsey Numbers of G

New Lower Bounds for Ramsey Numbers of Graphs and Hypergraphs

✍ Felix Lazebnik; Dhruv Mubayi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 146 KB 👁 1 views

## dedicated to the memory of rodica simion Let G be an r-uniform hypergraph. The multicolor Ramsey number r k G is the minimum n such that every k-coloring of the edges of the complete r-uniform hypergraph K r n yields a monochromatic copy of G. Improving slightly upon results from M. Axenovich,

Independence numbers of locally sparse g

Independence numbers of locally sparse graphs and a Ramsey type problem

✍ Noga Alon 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

Let G = (V, E ) be a graph on n vertices with average degree t 2 1 in which for every vertex u E V the induced subgraph on the set of all neighbors of u is r-colorable. We show that the independence number of G is at least log t , for some absolute positive constant c. This strengthens a well-known