New lower bounds for Ramsey numbers of graphs and hypergraphs

DOI10.1006/aama.2001.0794zbMath1002.05050OpenAlexW2115242161MaRDI QIDQ696820

Felix Lazebnik, Dhruv Mubayi

Publication date: 12 September 2002

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aama.2001.0794

zbMATH Keywords

uniform hypergraphrainbow colouringgeneralized Ramsey number

Mathematics Subject Classification ID

Hypergraphs (05C65) Generalized Ramsey theory (05C55)

Related Items (9)

Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs ⋮ Proof of a conjecture on monomial graphs ⋮ Some extremal results on complete degenerate hypergraphs ⋮ Connectivity of some algebraically defined digraphs ⋮ Multicolor Ramsey numbers for triple systems ⋮ On monomial graphs of girth eight ⋮ The Ramsey number of 3-uniform loose path versus star ⋮ Exact Ramsey numbers in multipartite graphs arising from Hadamard matrices and strongly regular graphs ⋮ Semisymmetric graphs defined by finite-dimensional generalized Kac-Moody algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On multicolor Ramsey numbers for complete bipartite graphs
• Norm-graphs: Variations and applications
• Generalised Ramsey numbers for small graphs
• On generalized Ramsey theory: The bipartite case
• New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\)
• New asymptotics for bipartite Turán numbers
• On extremal problems of graphs and generalized graphs
• Norm-graphs and bipartite Turán numbers
• Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
• On a problem of K. Zarankiewicz

This page was built for publication: New lower bounds for Ramsey numbers of graphs and hypergraphs