Long induced paths in expanders

Abstract We prove that any bounded degree regular graph with sufficiently strong spectral expansion contains an induced path of linear length. This is the first such result for expanders, strengthening an analogous result in the random setting by Draganić, Glock, and Krivelevich. More generally, we find long induced paths in sparse graphs that satisfy a mild upper-uniformity edge-distribution condition.

Authors

Institutions

Publication Details

Journal
Combinatorics Probability Computing
Published
2024-11-19
DOI
https://doi.org/10.1017/s096354832400035x
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Long induced paths in expanders

Nemanja Draganić, Peter Keevash
Combinatorics Probability Computing
Algorithms and Data Compression
article

Long induced paths in expanders

Nemanja Draganić, Peter Keevash
article en

Abstract

Abstract We prove that any bounded degree regular graph with sufficiently strong spectral expansion contains an induced path of linear length. This is the first such result for expanders, strengthening an analogous result in the random setting by Draganić, Glock, and Krivelevich. More generally, we find long induced paths in sparse graphs that satisfy a mild upper-uniformity edge-distribution condition.

Combinatorics Probability ComputingVol. 34(2)
University of Oxford (GB)
Openalex Percentile: Top 81%
Algorithms and Data Compression
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Long induced paths in expanders — Nemanja Draganić, Peter Keevash · Combinatorics Probability Computing (2024) | TGRS Research Map | TGRS