Coloring uniform hypergraphs with few edges
From MaRDI portal
Publication:3055779
Recommendations
Cites work
Cited in
(26)- Coloring hypergraphs with bounded cardinalities of edge intersections
- Random coloring method in the combinatorial problem of Erdős and Lovász
- Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number
- Hypergraph list coloring and Euclidean Ramsey theory
- Approximate coloring of uniform hypergraphs
- High girth hypergraphs with unavoidable monochromatic or rainbow edges
- Multipass greedy coloring of simple uniform hypergraphs
- Colourings of uniform hypergraphs with large girth and applications
- Colorings of b-simple hypergraphs
- Lower bounds for the number of edges in hypergraphs of certain classes
- DP-colorings of hypergraphs
- 2-colorings of hypergraphs with large girth
- Extremal problems in hypergraph colourings
- Colorings of partial Steiner systems and their applications
- Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees
- Extremal problems for colorings of simple hypergraphs and applications
- On \(r\)-chromatic hypergraphs
- Equitable two-colorings of uniform hypergraphs
- Lower bounds in the combinatorial problem of Erdős and Lovász
- Defective coloring of hypergraphs
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph
- scientific article; zbMATH DE number 5825874 (Why is no real title available?)
- Constructions of sparse uniform hypergraphs with high chromatic number
- Coloring hypergraphs of low connectivity
- Improved algorithms for colorings of simple hypergraphs and applications
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\)
This page was built for publication: Coloring uniform hypergraphs with few edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055779)
