Large Subgraphs without Short Cycles

DOI10.1137/140954416zbMath1327.05068arXiv1401.4928OpenAlexW2153561778MaRDI QIDQ3453565

Michael Krivelevich, Guillem Perarnau, Florent Foucaud

Publication date: 27 November 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

spanning subgraphsgirthdegreesprobabilistic methodsforbidden subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (11)

Short proofs of some extremal results. II. ⋮ Counting hypergraphs with large girth ⋮ LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS ⋮ Random polynomial graphs for random Turán problems ⋮ Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree ⋮ Relative Turán Problems for Uniform Hypergraphs ⋮ Maximum cardinality neighbourly sets in quadrilateral free graphs ⋮ Inverting the Turán problem with chromatic number ⋮ Relative Turán numbers for hypergraph cycles ⋮ Triangle-free subgraphs of hypergraphs ⋮ Inverse Turán numbers

This page was built for publication: Large Subgraphs without Short Cycles