The following pages link to Tiling Turán theorems (Q1586364):
Displaying 50 items.
- A degree sequence Hajnal-Szemerédi theorem (Q256981) (← links)
- The extremal function for partial bipartite tilings (Q412273) (← links)
- Condorcet domains of tiling type (Q423890) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- On the KŁR conjecture in random graphs (Q476516) (← links)
- A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs (Q697080) (← links)
- Bandwidth theorem for random graphs (Q765187) (← links)
- Sharp minimum degree conditions for the existence of disjoint theta graphs (Q820839) (← links)
- Packing \(k\)-partite \(k\)-uniform hypergraphs (Q891826) (← links)
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- Proof of the bandwidth conjecture of Bollobás and Komlós (Q957895) (← links)
- Vertex-disjoint cycles of the same length. (Q1405099) (← links)
- On a tiling conjecture of Komlós for 3-chromatic graphs. (Q1426117) (← links)
- First steps in combinatorial optimization on graphons: matchings (Q1689941) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Tiling tripartite graphs with 3-colorable graphs: the extreme case (Q1756047) (← links)
- Star-factors in graphs with large minimum degree (Q1791704) (← links)
- Almost-spanning subgraphs with bounded degree in dense graphs (Q1864574) (← links)
- A construction of uniquely colourable graphs with equal colour class sizes (Q1983120) (← links)
- Tilings in vertex ordered graphs (Q2131863) (← links)
- The minimum degree threshold for perfect graph packings (Q2149489) (← links)
- Disjoint cycles and chorded cycles in a graph with given minimum degree (Q2174581) (← links)
- A degree sequence version of the Kühn-Osthus tiling theorem (Q2195226) (← links)
- Tilings in graphons (Q2225467) (← links)
- Matching polytons (Q2278115) (← links)
- The complexity of perfect matchings and packings in dense hypergraphs (Q2284737) (← links)
- On the decomposition threshold of a given graph (Q2338634) (← links)
- Asymptotic multipartite version of the Alon-Yuster theorem (Q2407378) (← links)
- The structure of multiplicative tilings of the real line (Q2420248) (← links)
- Perfect packings with complete graphs minus an edge (Q2461771) (← links)
- Large planar subgraphs in dense graphs (Q2573646) (← links)
- Minimum degree conditions for large subgraphs (Q2851441) (← links)
- Packing \(k\)-partite \(k\)-uniform hypergraphs (Q2857424) (← links)
- Minimum degree thresholds for bipartite graph tiling (Q2888882) (← links)
- The Complexity of Perfect Packings in Dense Graphs (Q2988829) (← links)
- A hypergraph blow-up lemma (Q3094607) (← links)
- TILING DIRECTED GRAPHS WITH TOURNAMENTS (Q3119461) (← links)
- The Euler tiling formula (Q3150461) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Embedding spanning subgraphs of small bandwidth (Q3503507) (← links)
- Topological equivalence of tilings (Q4340140) (← links)
- Proof of a tiling conjecture of Komlós (Q4434471) (← links)
- <i>K</i><sub>4</sub><sup>−</sup>‐factor in a graph (Q4534211) (← links)
- Normalized difference set tiling conjecture (Q4556031) (← links)
- On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem (Q4959763) (← links)
- Triangle‐factors in pseudorandom graphs (Q4968390) (← links)
- Covering and tiling hypergraphs with tight cycles (Q4993263) (← links)
- (Q5047223) (← links)
- Dirac-type results for tilings and coverings in ordered graphs (Q5056387) (← links)
- A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs (Q5071104) (← links)
