Tiling Turán theorems
From MaRDI portal
Publication:1586364
DOI10.1007/s004930070020zbMath0949.05063OpenAlexW1971539651MaRDI QIDQ1586364
Publication date: 13 November 2000
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930070020
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
An Asymptotic Multipartite Kühn--Osthus Theorem, Sharp minimum degree conditions for the existence of disjoint theta graphs, Minimum degree thresholds for bipartite graph tiling, Tilings in vertex ordered graphs, K4−‐factor in a graph, Dirac-type results for tilings and coverings in ordered graphs, 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, Disjoint cycles and chorded cycles in a graph with given minimum degree, Asymptotic multipartite version of the Alon-Yuster theorem, Embedding clique-factors in graphs with low \(\ell\)-independence number, Graph Tilings in Incompatibility Systems, Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu, Packing \(k\)-partite \(k\)-uniform hypergraphs, Clique-factors in graphs with sublinear -independence number, Embedding spanning subgraphs of small bandwidth, First steps in combinatorial optimization on graphons: matchings, The extremal function for partial bipartite tilings, A degree sequence version of the Kühn-Osthus tiling theorem, Vertex-disjoint cycles of the same length., A Ramsey–Turán theory for tilings in graphs, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Combinatorial and computational aspects of graph packing and graph decomposition, On a tiling conjecture of Komlós for 3-chromatic graphs., The Complexity of Perfect Packings in Dense Graphs, On the KŁR conjecture in random graphs, Tilings in graphons, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Spanning 3-colourable subgraphs of small bandwidth in dense graphs, Covering and tiling hypergraphs with tight cycles, Perfect packings with complete graphs minus an edge, A construction of uniquely colourable graphs with equal colour class sizes, Proof of the bandwidth conjecture of Bollobás and Komlós, Tiling tripartite graphs with 3-colorable graphs: the extreme case, A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs, Unnamed Item, Matching polytons, A median-type condition for graph tiling, The complexity of perfect matchings and packings in dense hypergraphs, Star-factors in graphs with large minimum degree, Proof of a tiling conjecture of Komlós, On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem, Triangle‐factors in pseudorandom graphs, Tilings in Randomly Perturbed Dense Graphs, On the Chromatic Number of Matching Kneser Graphs, On Komlós’ tiling theorem in random graphs, A hypergraph blow-up lemma, Bandwidth theorem for random graphs, A Degree Sequence Komlós Theorem, TILING DIRECTED GRAPHS WITH TOURNAMENTS, Minimum degree conditions for large subgraphs, Large planar subgraphs in dense graphs, An Extension of the Blow-up Lemma to Arrangeable Graphs, On the decomposition threshold of a given graph, Almost-spanning subgraphs with bounded degree in dense graphs, A degree sequence Hajnal-Szemerédi theorem
