A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
From MaRDI portal
Publication:3512604
Recommendations
Cites work
- scientific article; zbMATH DE number 949303 (Why is no real title available?)
- A list analogue of equitable coloring
- Equitable coloring and the maximum degree
- Hamiltonian square-paths
- Note on Hamilton Circuits
- Ore-type graph packing problems
- Perfect Graphs and an Application to Optimizing Municipal Services
- Proof of the Seymour conjecture for large graphs
- The infamous upper tail
Cited in
(52)- A polyhedral approach for the equitable coloring problem
- Equitable vertex arboricity of graphs
- Equitable colorings of Kronecker products 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
- Ore-type versions of Brooks' theorem
- An improved upper bound on the density of universal random graphs
- Monochromatic bounded degree subgraph partitions
- A degree sequence Hajnal-Szemerédi theorem
- A large tree is \(tK_m\)-good
- On equitable colorings of sparse graphs
- Equitable colourings of Borel graphs
- Approximate multipartite version of the Hajnal-Szemerédi theorem
- On multipartite Hajnal-Szemerédi theorems
- Equitable critical graphs
- Extremal problems in hypergraph colourings
- Tiling directed graphs with tournaments
- Rainbow spanning structures in graph and hypergraph systems
- An extension of the Hajnal-Szemerédi theorem to directed graphs
- 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
- Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
- An Ore-type theorem on Hamiltonian square cycles
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4
- Equitable vertex arboricity of 5-degenerate graphs
- 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
- Continuity of multimarginal optimal transport with repulsive cost
- A fast algorithm for equitable coloring
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture
- A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs
- 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
- Packing \(K_r\)s in bounded degree graphs
- 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
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)
