Van der Waerden function and colorings of hypergraphs with large girth

DOI10.1134/S1064562413040388zbMath1310.05209OpenAlexW1989727117MaRDI QIDQ382207

Dmitriy A. Shabanov

Publication date: 18 November 2013

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

Full work available at URL: https://doi.org/10.1134/s1064562413040388

zbMATH Keywords

Ramsey theory problemrandom recoloring algorithm

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Related Items (1)

Multipass greedy coloring of simple uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Roth's theorem on progressions
• Two combinatorial theorems on arithmetic progressions
• On the chromatic number of simple triangle-free triple systems
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• An application of Lovász' local lemma-A new lower bound for the van der Waerden number
• Notes on Number Theory II : On a theorem of van der Waerden
• Szemerédi's theorem and problems on arithmetic progressions
• A Construction for Partitions Which Avoid Long Arithmetic Progressions
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• A new proof of Szemerédi's theorem

This page was built for publication: Van der Waerden function and colorings of hypergraphs with large girth