Pages that link to "Item:Q3512604"
From MaRDI portal
The following pages link to A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring (Q3512604):
Displaying 50 items.
- A degree sequence Hajnal-Szemerédi theorem (Q256981) (← links)
- The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (Q318921) (← links)
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs (Q326469) (← links)
- An Ore-type theorem on Hamiltonian square cycles (Q354425) (← links)
- Equitable vertex arboricity of graphs (Q394205) (← links)
- Approximate multipartite version of the Hajnal-Szemerédi theorem (Q412166) (← links)
- Equitable two-colorings of uniform hypergraphs (Q458597) (← links)
- On the KŁR conjecture in random graphs (Q476516) (← links)
- Monochromatic bounded degree subgraph partitions (Q501026) (← links)
- A refinement of a result of Corrádi and Hajnal (Q520047) (← links)
- A fast algorithm for equitable coloring (Q532129) (← links)
- Equitable versus nearly equitable coloring and the Chen-Lih-Wu Conjecture (Q555496) (← links)
- Equitable colorings of Kronecker products of graphs (Q602760) (← links)
- On equitable colorings of sparse graphs (Q726517) (← links)
- Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs (Q741756) (← links)
- Equitable colorings of planar graphs with maximum degree at least nine (Q764891) (← links)
- Equitable colorings of Cartesian products of graphs (Q765364) (← links)
- Ore-type versions of Brooks' theorem (Q1003831) (← links)
- Coloring by two-way independent sets (Q1044959) (← links)
- Equitable neighbour-sum-distinguishing edge and total colourings (Q1786869) (← links)
- Equitable colorings of planar graphs without short cycles (Q1929237) (← links)
- A note on relaxed equitable coloring of graphs (Q1944202) (← links)
- On multipartite Hajnal-Szemerédi theorems (Q1945958) (← links)
- \(K_r\)-factors in graphs with low independence number (Q1998757) (← links)
- Equitable partition of planar graphs (Q2022132) (← links)
- Constructing Armstrong tables for general cardinality constraints and not-null constraints (Q2254637) (← links)
- On equitable colorings of hypergraphs (Q2291188) (← links)
- Equitable colorings of hypergraphs with few edges (Q2309544) (← links)
- Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles (Q2345542) (← links)
- A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs (Q2353014) (← links)
- Asymptotic multipartite version of the Alon-Yuster theorem (Q2407378) (← links)
- Equitable vertex arboricity of 5-degenerate graphs (Q2410094) (← links)
- A polyhedral approach for the equitable coloring problem (Q2448876) (← links)
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4 (Q2657098) (← links)
- Sets of unit vectors with small subset sums (Q2796088) (← links)
- Equitable List Coloring of Graphs with Bounded Degree (Q2862547) (← links)
- A note on regular Ramsey graphs (Q3055921) (← links)
- Stackelberg network pricing is hard to approximate (Q3082599) (← links)
- TILING DIRECTED GRAPHS WITH TOURNAMENTS (Q3119461) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- An Average Case NP-complete Graph Colouring Problem (Q4962593) (← links)
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms (Q4971668) (← links)
- An improved upper bound on the density of universal random graphs (Q4982616) (← links)
- Equitable colourings of Borel graphs (Q5014071) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- Continuity of Multimarginal Optimal Transport with Repulsive Cost (Q5231329) (← links)
- An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs (Q5364255) (← links)
- A large tree is \(tK_m\)-good (Q6041579) (← links)
- Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu (Q6050000) (← links)
- Rainbow spanning structures in graph and hypergraph systems (Q6052079) (← links)
