Chain method for panchromatic colorings of hypergraphs

DOI10.1016/j.dam.2022.06.005zbMath1497.05065arXiv2008.03827OpenAlexW3047962697MaRDI QIDQ2172391

József Balogh, Margarita Akhmejanova, Dmitriy A. Shabanov

Publication date: 15 September 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.03827

zbMATH Keywords

uniform hypergraphproperty Bproper coloringpanchromatic coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs
• Asymptotic lower bounds for Ramsey functions
• A note on panchromatic colorings
• What we know and what we do not know about Turán numbers
• Equitable colorings of hypergraphs with few edges
• On the construction of 3-chromatic hypergraphs with few edges
• On a generalization of Rubin's theorem
• Greedy colorings of uniform hypergraphs
• Choice Numbers of Graphs: a Probabilistic Approach
• Extremal problems for panchromatic colourings of uniform hypergraphs
• Improved bounds and algorithms for hypergraph 2-coloring
• Extremal problems in hypergraph colourings
• On a property of families of sets
• On a combinatorial problem. II

This page was built for publication: Chain method for panchromatic colorings of hypergraphs