arXiv (All)
open access
Perfect matchings in hypergraphs and Feige's inequality
How large of a minimum degree does an $n$-vertex graph need before we are sure that it contains a perfect matching? Dirac's theorem states that a graph on an even number of vertices in which each vertex has degree at least $n/2$ has this property. In this short expository note, intended to be used i
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
- Ordered Ruzsa-Szemeredi Numbers at Matching Size Two#793857
- Near-optimal quantum query lower bounds on bipartiteness and expansion testing in the bounded-degree graph model#1157023
- Degree sequence condition for pancyclicity in tough graphs#1048854
- Sharp planar Turán bounds for quasi-double stars#1201719
- Inheritance of expansion and oriented Hamilton cycles in robust expanders: a regularity-free proof#1233111
Record · ID 1234805
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