arXiv (All)
open access
Bipartite Graphs Are Not Well-Quasi-Ordered by Bipartite Minors
In Bipartite minors [Journal of Combinatorial Theory, Series B, 2016], Chudnovsky et al. introduced the bipartite minor relation (a quasi-order on the class of bipartite graphs similar to the minor relation on general graphs) and asked whether it is a well-quasi-order. We answer this question negati
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
- Long induced paths in sparse graphs and graphs with forbidden patterns#925730
- On the maximum number of triangles in tripartite graphs with no $4$-cycles between any two parts#974703
- A linear bound for nested cycles without geometric crossings#985258
- Degree sequence condition for pancyclicity in tough graphs#1048854
- Systematic Data Structure Lower Bounds via the Query-with-Sketch Model#1011731
Record · ID 1116198
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