Ore-degree conditions for matchings in uniform hypergraphs
math.CO
Submitted: 2026-11-06
Updated: 2026-11-06
Terminology
Sources
- Matchings in hypergraphs via Ore-degree conditions
- Towards the Erd\H{o}s matching conjecture for 4-uniform hypergraphs: stability and applications
- A finite-board reduction for the Erd\H{o}s Matching Conjecture and the 4-uniform case via exact certificates
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