Triangle‐factors in pseudorandom graphs

DOI10.1112/blms.12237zbMath1425.05093arXiv1805.09710OpenAlexW2803584453WikidataQ128366555 ScholiaQ128366555MaRDI QIDQ4968390

Rajko Nenadov

Publication date: 12 July 2019

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationextremal problems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (7)

The threshold bias of the clique-factor game ⋮ Finding any given 2‐factor in sparse pseudorandom graphs efficiently ⋮ Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ A Ramsey–Turán theory for tilings in graphs ⋮ Near-perfect clique-factors in sparse pseudorandom graphs ⋮ Clique-factors in sparse pseudorandom graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Triangle factors in sparse pseudo-random graphs
• Powers of Hamilton cycles in pseudorandom graphs
• On the second eigenvalue of a graph
• Explicit Ramsey graphs and orthonormal labelings
• Tiling Turán theorems
• Near-perfect clique-factors in sparse pseudorandom graphs
• A condition for matchability in hypergraphs
• \(H\)-factors in dense graphs
• The minimum degree threshold for perfect graph packings
• A multipartite Hajnal-Szemerédi theorem
• Triangle factors of graphs without large independent sets and of weighted graphs
• Triangle-Tilings in Graphs Without Large Independent Sets
• [https://portal.mardi4nfdi.de/wiki/Publication:4261183 Variants of the Hajnal-Szemer�di Theorem]
• Triangle Factors in Random Graphs
• A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
• An Asymptotic Multipartite Kühn--Osthus Theorem
• A Sequence of Triangle-Free Pseudorandom Graphs
• A geometric theory for hypergraph matching
• Imbalances in k‐colorations
• On the maximal number of independent circuits in a graph
• Proof of the Alon-Yuster conjecture

This page was built for publication: Triangle‐factors in pseudorandom graphs