Equitable colorings of hypergraphs with few edges
From MaRDI portal
Publication:2309544
DOI10.1016/j.dam.2019.03.024zbMath1444.05050arXiv1909.00457OpenAlexW2936594045MaRDI QIDQ2309544
Margarita Akhmejanova, Dmitriy A. Shabanov
Publication date: 1 April 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.00457
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (5)
Chain method for panchromatic colorings of hypergraphs ⋮ Concepts on coloring of cluster hypergraphs with application ⋮ Extremal problems in hypergraph colourings ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) ⋮ Estimate of the number of edges in subgraphs of a Johnson graph
Cites Work
- Unnamed Item
- Unnamed Item
- A fast algorithm for equitable coloring
- Improved algorithms for colorings of simple hypergraphs and applications
- Using Lovász local lemma in the space of random injections
- On a bound in extremal combinatorics
- Colorings of \(b\)-simple hypergraphs
- A note on panchromatic colorings
- On the chromatic number of a random hypergraph
- On the concentration of the chromatic number of a random hypergraph
- Panchromatic 3-colorings of random hypergraphs
- An Ore-type theorem on equitable coloring
- Greedy colorings of uniform hypergraphs
- A note on random greedy coloring of uniform hypergraphs
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Colourings of Uniform Hypergraphs with Large Girth and Applications
- Hypergraph coloring up to condensation
- On chromatic number of graphs and set-systems
- Colorings of hypergraphs with large number of colors
This page was built for publication: Equitable colorings of hypergraphs with few edges
