Extremal problems for cycles in graphs

From MaRDI portal
Publication:2957176

DOI10.1007/978-3-319-24298-9_4zbMath1354.05069OpenAlexW2501351516MaRDI QIDQ2957176

Jacques Verstraete

Publication date: 25 January 2017

Published in: Recent Trends in Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24298-9_4




Related Items (35)

Large hypergraphs without tight cyclesHypergraphs with no tight cyclesSublinear-time distributed algorithms for detecting small cliques and even cyclesTwisted cubic and plane-line incidence matrix in \(\mathrm{PG}(3,q)\)On the Extremal Number of SubdivisionsLinear cycles of consecutive lengthsProperly colored cycles of different lengths in edge-colored complete graphsOn the maximum number of odd cycles in graphs without smaller odd cyclesCycles of many lengths in Hamiltonian graphsCounting hypergraphs with large girthUniform Turán density of cyclesIncidence matrices for the class \({\mathcal{O}}_6\) of lines external to the twisted cubic in \(\mathrm{PG}(3,q)\)A solution to Erdős and Hajnal’s odd cycle problemCombinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022Turán‐type problems for long cycles in random and pseudo‐random graphsSome tight lower bounds for Turán problems via constructions of multi-hypergraphsCovering point-sets with parallel hyperplanes and sparse signal recoveryThe asymptotics of \(r(4,t)\)Extremal numbers of hypergraph suspensions of even cyclesGeneralized Turán problems for even cyclesTriangles in graphs without bipartite suspensionsFacets of the Stochastic Network Flow ProblemThe Turán number of directed paths and oriented cyclesOn Tight Cycles in HypergraphsSparse Hypergraphs with Applications to Coding TheoryLong cycles in Hamiltonian graphsRelative Turán Problems for Uniform HypergraphsA Strengthening on Odd Cycles in Graphs of Given Chromatic NumberOn grids in point-line arrangements in the planeUnnamed ItemOn a conjecture of Bondy and VinceCycles of given lengths in hypergraphsOn Grids in Point-Line Arrangements in the PlaneExtremal Numbers of Cycles RevisitedRamsey Numbers for Nontrivial Berge Cycles




This page was built for publication: Extremal problems for cycles in graphs