arXiv (All)
open access
Long induced paths in sparse graphs and graphs with forbidden patterns
Consider a graph $G$ with a path $P$ of order $n$. What conditions force $G$ to also have a long induced path? As complete bipartite graphs have long paths but no long induced paths, a natural restriction is to forbid some fixed complete bipartite graph $K_{t,t}$ as a subgraph. In this case we show
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Bipartite Graphs Are Not Well-Quasi-Ordered by Bipartite Minors#1116198
- Odd and Even Harder Problems on Cycle-Factors#1104900
- On Perfect Divisibility of Bull-Free Graphs Without Long Paths#1034674
- Degree sequence condition for pancyclicity in tough graphs#1048854
- Breaking the $2^n$ barrier for directed hamiltonicity#1144029
Record · ID 925730
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive