Long cycles in locally expanding graphs, with applications

DOI10.1007/S00493-017-3701-1zbMath1438.05142arXiv1609.06851OpenAlexW2964026298WikidataQ130153985 ScholiaQ130153985MaRDI QIDQ2416516

Michael Krivelevich

Publication date: 23 May 2019

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theorypositional gameslong cycleslocally expanding graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Paths and cycles (05C38) Distance in graphs (05C12) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (15)

Short proofs for long induced paths ⋮ Crux and Long Cycles in Graphs ⋮ Note on the multicolour size-Ramsey number for paths ⋮ The size‐Ramsey number of short subdivisions ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ Long paths in heterogeneous random subgraphs of graphs with large minimum degree ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Finding and Using Expanders in Locally Sparse Graphs ⋮ An analogue of the Erdős-Gallai theorem for random graphs ⋮ Lower bounds of size Ramsey number for graphs with small independence number ⋮ Ordered size Ramsey number of paths ⋮ New lower bounds on the size-Ramsey number of a path ⋮ The size‐Ramsey number of powers of bounded degree trees ⋮ The multicolor size-Ramsey numbers of cycles ⋮ Expansion in supercritical random subgraphs of the hypercube and its consequences

This page was built for publication: Long cycles in locally expanding graphs, with applications