Establishes T(n,r) = O(r 2^n / (n+1)) for even r ≤ n/2 in the r-distance hypercube graph together with lower bounds across regimes of r and n.
Martin, Bal´ azs Patk´ os, A note on the Erd˝ os Matching Conjecture, arXiv:2404.12971, 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Triangle-free subsets of the $r$-distance graph of the Hypercube
Establishes T(n,r) = O(r 2^n / (n+1)) for even r ≤ n/2 in the r-distance hypercube graph together with lower bounds across regimes of r and n.