Colourings of uniform hypergraphs with large girth and applications
From MaRDI portal
Recommendations
- Improved algorithms for colorings of simple hypergraphs and applications
- Extremal problems for colorings of simple hypergraphs and applications
- van der Waerden's function and colourings of hypergraphs
- Multipass greedy coloring of simple uniform hypergraphs
- On coloring uniform hypergraphs without 3-cycles
Cites work
- A Construction for Partitions Which Avoid Long Arithmetic Progressions
- A new proof of Szemerédi's theorem
- A note on random greedy coloring of uniform hypergraphs
- An application of Lovász' local lemma-A new lower bound for the van der Waerden number
- Coloring n-sets red and blue
- Coloring uniform hypergraphs with few edges
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Constructions of sparse uniform hypergraphs with high chromatic number
- Greedy colorings of uniform hypergraphs
- scientific article; zbMATH DE number 5825874 (Why is no real title available?)
- scientific article; zbMATH DE number 5528961 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- Improved bounds and algorithms for hypergraph 2-coloring
- Multipass greedy coloring of simple uniform hypergraphs
- Notes on Number Theory II : On a theorem of van der Waerden
- On 3-chromatic hypergraphs
- On r-chromatic hypergraphs
- On Roth's theorem on progressions
- Random coloring method in the combinatorial problem of Erdős and Lovász
- Sets of integers that do not contain long arithmetic progressions
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Two combinatorial theorems on arithmetic progressions
- van der Waerden's function and colourings of hypergraphs
Cited in
(19)- On rainbow-free colourings of uniform hypergraphs
- 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
- The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets
- 2-colorings of hypergraphs with large girth
- Coloring hypergraphs with bounded cardinalities of edge intersections
- Equitable colorings of hypergraphs with few edges
- Panchromatic 3-colorings of random hypergraphs
- Random constructions of hypergraphs with large girth and without panchromatic colorings
- van der Waerden's function and colourings of hypergraphs
- Extremal problems for colorings of simple hypergraphs and applications
- Ramsey-type numbers involving graphs and hypergraphs with large girth
- Multipass greedy coloring of simple uniform hypergraphs
- Van der Waerden function and colorings of hypergraphs with large girth
- The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
- Approximate coloring of uniform hypergraphs
- Extremal problems in hypergraph colourings
- On the degree, size, and chromatic index of a uniform hypergraph
- Improved algorithms for colorings of simple hypergraphs and applications
This page was built for publication: Colourings of uniform hypergraphs with large girth and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4643316)
