2-colorings of hypergraphs with large girth
From MaRDI portal
Publication:2197249
DOI10.1134/S0001434620070202zbMath1485.05057OpenAlexW3047600982MaRDI QIDQ2197249
Publication date: 31 August 2020
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0001434620070202
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On general two-colorings of uniform hypergraphs
- On one combinatorial problem of Erdös
- Improved algorithms for colorings of simple hypergraphs and applications
- On the difference between asymptotically good packings and coverings
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring
- Coloring hypergraphs with bounded cardinalities of edge intersections
- On the weak chromatic number of random hypergraphs
- On small \(n\)-uniform hypergraphs with positive discrepancy
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Combinatorial extremum problems for 2-colorings of hypergraphs
- Coloring uniform hypergraphs with few edges
- Constructions of sparse uniform hypergraphs with high chromatic number
- 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
- A note on random greedy coloring of uniform hypergraphs
- Colourings of Uniform Hypergraphs with Large Girth and Applications
- Randomized algorithms for colourings of hypergraphs
- Improved bounds and algorithms for hypergraph 2-coloring
- Extremal problems in hypergraph colourings
- Two-Colorings of a Random Hypergraph
- Extremal problems for colourings of uniform hypergraphs
- On a property of families of sets
- On a combinatorial problem. II
- On the existence of regular n-graphs with given girth
This page was built for publication: 2-colorings of hypergraphs with large girth
