scientific article; zbMATH DE number 3344609

zbMath0217.02601MaRDI QIDQ5620621

Endre Szemerédi, Andras Hajnal

Publication date: 1970

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items

Equitable chromatic number of weak modular product of Some graphs, Tilings in vertex ordered graphs, Minimum Degrees for Powers of Paths and Cycles, Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem, Dirac-type results for tilings and coverings in ordered graphs, Unnamed Item, Improving lower bounds for equitable chromatic number, The minimum degree threshold for perfect graph packings, A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs, Powers of Hamilton cycles of high discrepancy are unavoidable, A Tabu Search Heuristic for the Equitable Coloring Problem, Proportional choosability of complete bipartite graphs, Equitable clique-coloring in claw-free graphs with maximum degree at most 4, Stability for vertex cycle covers, On Equitable Coloring of Book Graph Families, Inverse problems for minimal complements and maximal supplements, On Equitable List Arboricity of Graphs, On equitable chromatic number of Tadpole graph T_{m,n}, Disjoint cycles and chorded cycles in a graph with given minimum degree, Equitable list vertex colourability and arboricity of grids, Asymptotic multipartite version of the Alon-Yuster theorem, Triangle resilience of the square of a Hamilton cycle in random graphs, The threshold bias of the clique-factor game, Equitable colorings of corona multiproducts of graphs, A greedy algorithm for the social golfer and the Oberwolfach problem, Equitable colorings of hypergraphs with \(r\) colors, Building Spanning Trees Quickly in Maker-Breaker Games, On resilience of connectivity in the evolution of random graphs, Spanning trees in dense directed graphs, The minimum number of clique-saturating edges, Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles, A degree sequence version of the Kühn-Osthus tiling theorem, Extremal problems in hypergraph colourings, Completion and deficiency problems, Tiling multipartite hypergraphs in quasi-random hypergraphs, A rainbow blow‐up lemma, A rainbow blow-up lemma for almost optimally bounded edge-colourings, The bandwidth theorem for locally dense graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A blow-up lemma for approximate decompositions, A Sharp Dirac–Erdős Type Bound for Large Graphs, Covering and tiling hypergraphs with tight cycles, Perfect packings with complete graphs minus an edge, Packing \(d\)-degenerate graphs, An Ore-type theorem on equitable coloring, Equitable partitions into matchings and coverings in mixed graphs, Equitable coloring planar graphs with large girth, Constructing Armstrong tables for general cardinality constraints and not-null constraints, Vertex-disjoint rainbow triangles in edge-colored graphs, Chromatic number via Turán number, Equitable partition of planar graphs, Random perturbation of sparse graphs, Theoretical aspects of equitable partition of networks into sparse modules, Sets of unit vectors with small subset sums, The complexity of perfect matchings and packings in dense hypergraphs, Unnamed Item, On Hamiltonian cycles in hypergraphs with dense link graphs, On equitable colorings of hypergraphs, On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem, A note on the equitable choosability of complete bipartite graphs, On list equitable total colorings of the generalized theta graph, Locally boundedk-colorings of trees, Triangle‐factors in pseudorandom graphs, Tilings in Randomly Perturbed Dense Graphs, Routing in Undirected Graphs with Constant Congestion, Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process, Embedding spanning subgraphs in uniformly dense and inseparable graphs, Relaxed equitable colorings of planar graphs with girth at least 8, Equitable partition of plane graphs with independent crossings into induced forests, Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles, Equitable colorings of hypergraphs with few edges, Codegree Thresholds for Covering 3-Uniform Hypergraphs, Clique Counting in MapReduce, Vertex-disjoint double chorded cycles in bipartite graphs, Proportional 2-choosability with a bounded palette, Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs, Proportional choosability: a new list analogue of equitable coloring, Sprinkling a Few Random Edges Doubles the Power, Powers of Hamiltonian cycles in multipartite graphs, Sharp concentration of the equitable chromatic number of dense random graphs, A discrepancy version of the Hajnal–Szemerédi theorem, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions, Perfect colorings of regular graphs, On the equitable choosability of the disjoint union of stars, TILING DIRECTED GRAPHS WITH TOURNAMENTS, Minimum degree conditions for large subgraphs, Forcing spanning subgraphs via Ore type conditions, Cyclic triangle factors in regular tournaments, Anti-Ramsey numbers for vertex-disjoint triangles, On chromatic number and minimum cut, Equitable total-coloring of subcubic graphs, Maker-Breaker Games on Randomly Perturbed Graphs, Equitable partition of graphs into induced forests, Equitable colourings of Borel graphs, Ramsey numbers for complete graphs versus generalized fans, Results and problems on chorded cycles: a survey, Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles, An Evans-Style Result for Block Designs, Extremal graphs for two vertex-disjoint copies of a clique, Perfect packings in quasirandom hypergraphs. I., Independent cycles with limited size in a graph, The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs, Vertex-disjoint subgraphs with high degree sums, Equitable colorings of non-uniform simple hypergraphs, Equitable colorings of nonuniform hypergraphs, Equitable coloring and equitable choosability of graphs with small maximum average degree, A DSATUR-based algorithm for the equitable coloring problem, On the Corrádi-Hajnal theorem and a question of Dirac, Decomposition of bipartite graphs into special subgraphs, On equitable coloring of bipartite graphs, Edge coloring complete uniform hypergraphs with many components, Equitable colorings of Kronecker products of graphs, Equitable and equitable list colorings of graphs, Equitable and list equitable colorings of planar graphs without 4-cycles, Equitable colorings of planar graphs without short cycles, Equitable vertex arboricity of graphs, Packing \(k\)-partite \(k\)-uniform hypergraphs, On directed versions of the Corrádi-Hajnal corollary, Packing two graphs of even girth 10, Covering and tiling hypergraphs with tight cycles, Equitable \(\Delta\)-coloring of graphs, Approximate multipartite version of the Hajnal-Szemerédi theorem, The extremal function for partial bipartite tilings, Colorful triangle counting and a \textsc{MapReduce} implementation, On the existence of vertex-disjoint subgraphs with high degree sum, On the complexity of some colorful problems parameterized by treewidth, A note on relaxed equitable coloring of graphs, Directed domination in oriented graphs, On multipartite Hajnal-Szemerédi theorems, Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Disjoint cliques in claw-free graphs, Equivalence of two conjectures on equitable coloring of graphs, Chromatic optimisation: Limitations, objectives, uses, references, Combinatorial and computational aspects of graph packing and graph decomposition, Equitable two-colorings of uniform hypergraphs, Bisections of graphs, On a tiling conjecture of Komlós for 3-chromatic graphs., Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem, Equitable and proportional coloring of trees, A note on maximum differential coloring of planar graphs, On the KŁR conjecture in random graphs, Intersecting designs, A flow based pruning scheme for enumerative equitable coloring algorithms, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges, On embedding well-separable graphs, Quadripartite version of the Hajnal-Szemerédi theorem, A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives, Monochromatic bounded degree subgraph partitions, Transitive triangle tilings in oriented graphs, A \((\Delta / 2)\)-approximation algorithm for the maximum independent set problem, Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs, Equitable list colorings of planar graphs without short cycles, A refinement of a result of Corrádi and Hajnal, The total chromatic number of graphs having large maximum degree, Bounded vertex colorings of graphs, Recent results on the total chromatic number, Equitable coloring of three classes of 1-planar graphs, Tiling tripartite graphs with 3-colorable graphs: the extreme case, Total equitable list coloring, \(K_r\)-factors in graphs with low independence number, How to avoid using the regularity Lemma: Pósa's conjecture revisited, On equitable and equitable list colorings of series-parallel graphs, A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs, Hamilton decompositions of balanced complete multipartite graphs with primitive leaves, Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs, Equipartite colorings in graphs and hypergraphs, Equitable neighbour-sum-distinguishing edge and total colourings, On equitable colorings of sparse graphs, Star-factors in graphs with large minimum degree, \(K_{1,3}\)-factors in graphs, Equitable coloring of some convex polytope graphs, Packings of graphs and applications to computational complexity, Ore-type versions of Brooks' theorem, Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs, Orthogonal decomposition and packing of complete graphs, Subgraphs with triangular components, A note on equitable colorings of forests, Triangle packings and 1-factors in oriented graphs, Equitable defective coloring of sparse planar graphs, Equitable colorings of planar graphs with maximum degree at least nine, Bandwidth theorem for random graphs, Equitable colorings of Cartesian products of graphs, Vertex-disjoint claws in graphs, Ore-type conditions implying 2-factors consisting of short cycles, Coloring by two-way independent sets, Vertex-disjoint hexagons with chords in a bipartite graph, Triangles in claw-free graphs, On quadrilaterals in a graph, On the maximum number of independent cycles in a graph, Totally critical even order graphs, Colouring the discretization graphs arising in the multigrid method, Almost-spanning subgraphs with bounded degree in dense graphs, A sufficient condition for equitable edge-colourings of simple graphs, A degree sequence Hajnal-Szemerédi theorem, Equitable colorings of bounded treewidth graphs, On equitable \(\Delta\)-coloring of graphs with low average degree, Sparse universal graphs, An Asymptotic Multipartite Kühn--Osthus Theorem, Triangles in randomly perturbed graphs, Irregular subgraphs, On deficiency problems for graphs, A spanning bandwidth theorem in random graphs, Bandwidth, treewidth, separators, expansion, and universality, Embedding clique-factors in graphs with low \(\ell\)-independence number, A large tree is \(tK_m\)-good, Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs, Graph Tilings in Incompatibility Systems, Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu, Rainbow spanning structures in graph and hypergraph systems, Equitable critical graphs, Clique-factors in graphs with sublinear -independence number, Shotgun reconstruction in the hypercube, Factors in randomly perturbed hypergraphs, Covering cycles in sparse graphs, On sufficient conditions for spanning structures in dense graphs, Independence number of hypergraphs under degree conditions, Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings, Results about the total chromatic number and the conformability of some families of circulant graphs, Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization, A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS, F$F$‐factors in Quasi‐random Hypergraphs, A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification, A Ramsey–Turán theory for tilings in graphs, Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph, Extremal numbers for disjoint copies of a clique, The complete value of the Turán number of \(3K_{p+1}\), An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs, On Directed Versions of the Hajnal–Szemerédi Theorem, Perfect Packings in Quasirandom Hypergraphs II, Minimum Codegree Threshold forC₆³-Factors in 3-Uniform Hypergraphs, Exact Minimum Codegree Threshold for K⁻₄-Factors, Edge-decompositions of graphs with high minimum degree, Irregularity strength of dense graphs, The binding number of a graph and its Anderson number, Independent triangles covering given vertices of a graph, On the equitable chromatic number of complete \(n\)-partite graphs, A median-type condition for graph tiling, Your rugby mates don't need to know your colleagues: triadic closure with edge colors, On Komlós’ tiling theorem in random graphs, Continuity of Multimarginal Optimal Transport with Repulsive Cost, A Degree Sequence Komlós Theorem, Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree, An Extension of the Blow-up Lemma to Arrangeable Graphs, Transversal factors and spanning trees