arXiv (All)
open access
A Near-Optimal Linear Range for the Erdős Matching Conjecture
The Erdős Matching Conjecture is governed by two competing ways of excluding $s+1$ disjoint edges: one may concentrate all edges on fewer than $k(s+1)$ vertices, or force every edge to meet a fixed $s$-set. We determine a near-optimal range in which the second construction is extremal. For every fix
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
- Extremal Families for the Erdős--Kleitman Problem: The Missing Constructions#800116
- Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs#987368
- List coloring $C_3$-free planar graphs with a sparse matching of restricted lists#819736
- List coloring $C_3$-free planar graphs with a sparse matching of restricted lists#809740
- On a problem concerning $\mathbb Z_3$-Ramsey numbers#1064332
Record · ID 985218
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