Triangle-Tilings in Graphs Without Large Independent Sets

DOI10.1017/S0963548318000196zbMath1391.05199arXiv1607.07789OpenAlexW2962968627WikidataQ129857234 ScholiaQ129857234MaRDI QIDQ3177358

József Balogh, Theodore Molla, Andrew McDowell, Richard Mycroft

Publication date: 24 July 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.07789

zbMATH Keywords

minimum degreealmost-perfect triangle-tilingsperfect triangle-tilings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of tessellation and tiling problems (05B45) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (11)

Disjoint cycles in graphs with restricted independence number ⋮ Triangle factors of graphs without large independent sets and of weighted graphs ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ The bandwidth theorem for locally dense graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Two Conjectures in Ramsey--Turán Theory ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ \(K_r\)-factors in graphs with low independence number ⋮ On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem ⋮ Triangle‐factors in pseudorandom graphs ⋮ Tilings in Randomly Perturbed Dense Graphs

Cites Work

• Approximate multipartite version of the Hajnal-Szemerédi theorem
• More results on Ramsey-Turán type problems
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• On a Ramsey-Turán type problem
• Blow-up lemma
• Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
• Asymptotic multipartite version of the Alon-Yuster theorem
• Triangle factors of graphs without large independent sets and of weighted graphs
• Graph Theory and Probability. II
• On the maximal number of independent circuits in a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Triangle-Tilings in Graphs Without Large Independent Sets