Ore-degree conditions for hypergraph matchings
math.CO
Submitted: 2026-10-30
Updated: 2026-10-30
Comments: 19 pages
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Matchings in hypergraphs via Ore-degree conditions
- On degree bounds of $k$-uniform hypergraphs with bounded matching number
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality