Colourings of Uniform Hypergraphs with Large Girth and Applications
From MaRDI portal
Publication:4643316
DOI10.1017/S0963548317000475zbMath1387.05093OpenAlexW2763139310MaRDI QIDQ4643316
Dmitriy A. Shabanov, Andrey B. Kupavskii
Publication date: 24 May 2018
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548317000475
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (10)
Random constructions of hypergraphs with large girth and without panchromatic colorings ⋮ Panchromatic 3-colorings of random hypergraphs ⋮ The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets ⋮ Improved algorithms for colorings of simple hypergraphs and applications ⋮ 2-colorings of hypergraphs with large girth ⋮ Extremal problems in hypergraph colourings ⋮ Coloring hypergraphs with bounded cardinalities of edge intersections ⋮ Equitable colorings of hypergraphs with few edges ⋮ New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) ⋮ High girth hypergraphs with unavoidable monochromatic or rainbow edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sets of integers that do not contain long arithmetic progressions
- On Roth's theorem on progressions
- On \(r\)-chromatic hypergraphs
- Two combinatorial theorems on arithmetic progressions
- On 3-chromatic hypergraphs
- Coloring n-sets red and blue
- Greedy colorings of uniform hypergraphs
- Coloring uniform hypergraphs with few edges
- Constructions of sparse uniform hypergraphs with high chromatic number
- Van der Waerden's function and colourings of hypergraphs
- Random coloring method in the combinatorial problem of Erdős and Lovász
- 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
- A note on random greedy coloring of uniform hypergraphs
- Multipass greedy coloring of simple uniform hypergraphs
- Improved bounds and algorithms for hypergraph 2-coloring
- 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: Colourings of Uniform Hypergraphs with Large Girth and Applications
