Pages that link to "Item:Q5937938"

The following pages link to Proof of the Alon-Yuster conjecture (Q5937938):

Displaying 35 items.

• Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
• Cycles of Given Size in a Dense Graph (Q3455245) (← links)
• Proof of a tiling conjecture of Komlós (Q4434471) (← links)
• <i>K</i>₄⁻‐factor in a graph (Q4534211) (← links)
• A blow-up lemma for approximate decompositions (Q4633567) (← links)
• Embedding Spanning Bipartite Graphs of Small Bandwidth (Q4903263) (← links)
• On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem (Q4959763) (← links)
• Triangle‐factors in pseudorandom graphs (Q4968390) (← links)
• A discrepancy version of the Hajnal–Szemerédi theorem (Q4993133) (← links)
• Covering and tiling hypergraphs with tight cycles (Q4993263) (← links)
• Dirac-type results for tilings and coverings in ordered graphs (Q5056387) (← links)
• A rainbow blow‐up lemma (Q5128752) (← links)
• A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← links)
• Tilings in Randomly Perturbed Dense Graphs (Q5219315) (← links)
• Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles (Q5222560) (← links)
• On the Chromatic Number of Matching Kneser Graphs (Q5222567) (← links)
• On Komlós’ tiling theorem in random graphs (Q5222573) (← links)
• A Degree Sequence Komlós Theorem (Q5238748) (← links)
• An Extension of the Blow-up Lemma to Arrangeable Graphs (Q5254090) (← links)
• Minimum Vertex Degree Threshold for ‐tiling* (Q5265336) (← links)
• An Asymptotic Multipartite Kühn--Osthus Theorem (Q5275440) (← links)
• Bandwidth, treewidth, separators, expansion, and universality (Q5300988) (← links)
• Perfect Packings in Quasirandom Hypergraphs II (Q5366906) (← links)
• Minimum Codegree Threshold for<i>C</i>₆³-Factors in 3-Uniform Hypergraphs (Q5366961) (← links)
• Embedding clique-factors in graphs with low \(\ell\)-independence number (Q6038592) (← links)
• Graph Tilings in Incompatibility Systems (Q6046822) (← links)
• Rainbow spanning structures in graph and hypergraph systems (Q6052079) (← links)
• Factors in randomly perturbed hypergraphs (Q6074679) (← links)
• Tiling edge-ordered graphs with monotone paths and other structures (Q6561321) (← links)
• Minimum degree threshold for \(H\)-factors with high discrepancy (Q6614188) (← links)
• \(H\)-factors in graphs with small independence number (Q6615761) (← links)
• Optimal spread for spanning subgraphs of Dirac hypergraphs (Q6615765) (← links)
• A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q6621195) (← links)
• Sufficient conditions for perfect mixed tilings (Q6652093) (← links)
• Compatible powers of Hamilton cycles in dense graphs (Q6657592) (← links)