A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring

Cites Work

Title not available (Why is that?)
Proof of the Seymour conjecture for large graphs
Note on Hamilton Circuits
Equitable coloring and the maximum degree
Hamiltonian square-paths
Perfect Graphs and an Application to Optimizing Municipal Services
Ore-type graph packing problems
The infamous upper tail
A list analogue of equitable coloring

Cited In (53)

An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
A polyhedral approach for the equitable coloring problem
Equitable colorings of Kronecker products of graphs
Equitable vertex arboricity of graphs
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
\(K_r\)-factors in graphs with low independence number
A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS
An improved upper bound on the density of universal random graphs
Ore-type versions of Brooks' theorem
Monochromatic bounded degree subgraph partitions
A large tree is \(tK_m\)-good
A degree sequence Hajnal-Szemerédi theorem
Continuity of Multimarginal Optimal Transport with Repulsive Cost
Equitable colourings of Borel graphs
Equitable critical graphs
On equitable colorings of sparse graphs
On multipartite Hajnal-Szemerédi theorems
Approximate multipartite version of the Hajnal-Szemerédi theorem
Extremal problems in hypergraph colourings
Rainbow spanning structures in graph and hypergraph systems
Sets of unit vectors with small subset sums
Constructing Armstrong tables for general cardinality constraints and not-null constraints
A note on regular Ramsey graphs
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
Equitable clique-coloring in claw-free graphs with maximum degree at most 4
Equitable vertex arboricity of 5-degenerate graphs
Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
An Ore-type theorem on Hamiltonian square cycles
Equitable two-colorings of uniform hypergraphs
Equitable colorings of planar graphs with maximum degree at least nine
Asymptotic multipartite version of the Alon-Yuster theorem
Equitable neighbour-sum-distinguishing edge and total colourings
Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
Equitable colorings of Cartesian products of graphs
Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
TILING DIRECTED GRAPHS WITH TOURNAMENTS
A fast algorithm for equitable coloring
A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs
Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
Coloring by two-way independent sets
On equitable colorings of hypergraphs
Equitable colorings of hypergraphs with few edges
On the KŁR conjecture in random graphs
Equitable list coloring of graphs with bounded degree
Stackelberg network pricing is hard to approximate
Equitable colorings of planar graphs without short cycles
A note on relaxed equitable coloring of graphs
Equitable partition of planar graphs
A refinement of a result of Corrádi and Hajnal
An Average Case NP-complete Graph Colouring Problem
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
Packing \(K_r\)s in bounded degree graphs

This page was built for publication: A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512604)