arXiv (OAI Expanded)
open access
Online matching games in bipartite expanders: Hall-type results and applications to non-blocking connectors
The classical Hall Theorem shows the equivalence between \emph{offline} matching in bipartite graphs and a certain expansion property. We show that lossless expansion implies efficient online matching. Online matching is defined by the following game: an opponent switches on and off nodes on the lef
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
- The maximum number of edges in minimal matching covered graphs#1105537
- Winning Before You Play: An Iterative Capture Algorithm for Pre-Game Dominance Analysis in Three-Player Auction Bridge#1077543
- Greedy-Like Defective Coloring: Distributed Algorithms and Applications#999838
- Balancing linear extensions in posets#348789
- Ordered matchings versus triangles via pseudorandom triangle-free graphs#1014222
Record · ID 1083935
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