arXiv (All)
open access
On the odd independence number of the Queen graph
A set S of vertices of a graph is odd independent if it is independent and every vertex outside S has either zero or an odd number of neighbors in S. The largest size of such a set is the odd independence number alpha_od. Caro, Petrusevski, Skrekovski and Tuza [2] conjectured that alpha_od = 1 for e
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
- On the Classical and Parameterized Complexity of Strong Odd Coloring#1156713
- Füredi's Conjecture and a Sharp Strengthening#1258006
- Hedetniemi's Conjecture for Uncountable Complementary Graphs#1217762
- A proof of Bickle's conjecture on collapsible graphs#616780
- A proof of Bickle's conjecture on collapsible graphs#616280
Record · ID 1233951
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