Constructions of sparse uniform hypergraphs with high chromatic number
From MaRDI portal
Recommendations
Cites work
- Coloring uniform hypergraphs with few edges
- scientific article; zbMATH DE number 3659621 (Why is no real title available?)
- Hypergraphs with high chromatic number
- Improved bounds and algorithms for hypergraph 2-coloring
- On the chromatic number of set systems
- On the difference between asymptotically good packings and coverings
- On the existence of regular n-graphs with given girth
- On the lower bound for the chromatic number of graphs with given maximal degree and girth
Cited in
(29)- Hypergraphs with high chromatic number
- Colorings of b-simple hypergraphs
- New construction of graphs with high chromatic number and small clique number
- The Cayley isomorphism property for Cayley maps
- Coloring cross-intersecting families
- 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
- 2-colorings of hypergraphs with large girth
- Mycielski type constructions for hypergraphs associated with fractional colorings
- Coloring hypergraphs with bounded cardinalities of edge intersections
- \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs
- Hypergraphs with zero chromatic threshold
- Random constructions of hypergraphs with large girth and without panchromatic colorings
- Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number
- Coloring sparse hypergraphs
- Random coloring method in the combinatorial problem of Erdős and Lovász
- Coloring, sparseness and girth
- On regular hypergraphs with high girth and high chromatic number
- Dense uniform hypergraphs have high list chromatic number
- On coloring uniform hypergraphs without 3-cycles
- Colourings of uniform hypergraphs with large girth and applications
- Extremal problems in hypergraph colourings
- A Combinatorial Classic — Sparse Graphs with High Chromatic Number
- Colorings of hypergraphs with large number of colors
- Coloring unions of nearly disjoint hypergraph cliques
- On r-chromatic hypergraphs
- Improved algorithms for colorings of simple hypergraphs and applications
- Selective hypergraph colourings
- A hypergraph-free construction of highly chromatic graphs without short cycles
This page was built for publication: Constructions of sparse uniform hypergraphs with high chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055877)
