A note on panchromatic colorings
From MaRDI portal
Publication:1690224
DOI10.1016/j.disc.2017.10.030zbMath1378.05052arXiv1705.03797OpenAlexW2962842655MaRDI QIDQ1690224
Publication date: 19 January 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.03797
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)
Related Items
Chain method for panchromatic colorings of hypergraphs ⋮ Equitable colorings of hypergraphs with \(r\) colors ⋮ 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 ⋮ Extremal problems in hypergraph colourings ⋮ Panchromatic colorings of random hypergraphs ⋮ Coloring hypergraphs with bounded cardinalities of edge intersections ⋮ Equitable colorings of hypergraphs with few edges
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph
- On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
- Density conditions for panchromatic colourings of hypergraphs
- On the construction of 3-chromatic hypergraphs with few edges
- On a generalization of Rubin's theorem
- Greedy colorings of uniform hypergraphs
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
- The existence of panchromatic colourings for uniform hypergraphs
- Choice Numbers of Graphs: a Probabilistic Approach
- On a combinatorial problem. II