Triangle factors of graphs without large independent sets and of weighted graphs

DOI10.1002/rsa.20670zbMath1352.05141OpenAlexW2478927256MaRDI QIDQ2953695

Maryam Sharifzadeh, József Balogh, Theodore Molla

Publication date: 5 January 2017

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20670

zbMATH Keywords

partitioningmatchingfactorizationextremal problemsprobabilistic methodscovering and packing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)

Related Items (16)

Triangle-Tilings in Graphs Without Large Independent Sets ⋮ Disjoint cycles in graphs with restricted independence number ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Clique-factors in graphs with sublinear -independence number ⋮ On Two Problems in Ramsey--Turán Theory ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ Tiling multipartite hypergraphs in quasi-random hypergraphs ⋮ Tree decompositions of graphs without large bipartite holes ⋮ 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 ⋮ Embedding spanning subgraphs in uniformly dense and inseparable graphs

Cites Work

• On directed versions of the Corrádi-Hajnal corollary
• Triangle factors in sparse pseudo-random graphs
• More results on Ramsey-Turán type problems
• Quadripartite version of the Hajnal-Szemerédi theorem
• Triangle packings and 1-factors in oriented graphs
• On a Ramsey-Turán type problem
• \(H\)-factors in dense graphs
• Transitive triangle tilings in oriented graphs
• \(F\)-factors in hypergraphs via absorption
• A multipartite Hajnal-Szemerédi theorem
• An Ore-type theorem on equitable coloring
• Some exact Ramsey-Turán numbers
• Triangle-Tilings in Graphs Without Large Independent Sets
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
• [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
• Turán-Ramsey Theorems and K_p-Independence Numbers
• Towards a Weighted Version of the Hajnal–Szemerédi Theorem
• An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
• On Directed Versions of the Hajnal–Szemerédi Theorem
• Explicit constructions of triple systems for Ramsey–Turán problems
• On the maximal number of independent circuits in a graph
• Ramsey-Turán theory
• Independent directed triangles in a directed graph
• Proof of the Alon-Yuster conjecture

This page was built for publication: Triangle factors of graphs without large independent sets and of weighted graphs