Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)

DOI10.1016/0012-365X(93)E0139-UzbMath0822.05047OpenAlexW2015322433MaRDI QIDQ1343782

Hanno Lefmann, Vojtěch Rödl, Dwight Duffus

Publication date: 28 September 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0139-u

zbMATH Keywords

Ramsey numberhypergraphslower boundscoloringshift graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Generalized Ramsey theory (05C55) Directed graphs (digraphs), tournaments (05C20)

Related Items

The chromatic number of finite type-graphs, Off-diagonal hypergraph Ramsey numbers, The dynamic descriptive complexity of \(k\)-clique, The Erdős-Hajnal hypergraph Ramsey problem, On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs, Multicolor Ramsey numbers for triple systems, Shift graphs on precompact families of finite sets of natural numbers, On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness, Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems, Hypergraph Ramsey numbers: tight cycles versus cliques, Borel chromatic numbers, Miscellaneous Digraph Classes, On Erdős-Rado numbers, Extractors for small zero-fixing sources

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound for Ramsey's theorem
• Intersection theorems and mod \(p\) rank of inclusion matrices
• A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
• Arc colorings of digraphs
• Partition relations for cardinal numbers
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• Combinatorial Relations and Chromatic Graphs