arXiv (All)
open access
Biclique immersions in graphs with independence number 2
The analogue of Hadwiger's conjecture for the immersion relation states that every graph $G$ contains an immersion of $K_{χ(G)}$. For graphs with independence number 2, this is equivalent to stating that every such $n$-vertex graph contains an immersion of $K_{\lceil n/2 \rceil}$. We show that every
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
- A finite-graph conjecture related to $θ(p_c)=0$ for Bernoulli bond percolation on $\mathbb Z^d$#971895
- Planarity and number of crossings in general models of random geometric graphs#985751
- On dimensional implication graphs#246700
- The Borel Distinguishing Number of Schreier Graphs#1084902
- Off-Diagonal Commonality of Graphs via Entropy#628830
Record · ID 984786
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