The exact digirth and out-degree bounds for C(k,k) -subdivision and out-forest in digraphs
math.CO
Submitted: 2026-10-28
Updated: 2026-10-28
Comments: 15 pages,2 figures
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
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