Math 2.0

Resources / preprint

A sharp upper bound on the number of spanning forests of regular graphs NDKWV5J14V

URIm2://res/NDKWV5J14V
Kindpreprint
CreatorsT. Wu, S. Lu, X. Dong
Date2026-10-05
MSC05-XX
Subjectsarxiv math.CO
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-10-05
IdsarXiv 2610.05722

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
2F5V2ZR8K5statementlemma 2.2arxiv
3V26KNA5D6statementtheorem 1.1arxiv
4AWCJVDYFKstatementlemma 2.7arxiv
4BP3PMT74Rstatementlemma 2.9arxiv
61GHFDN7MVstatementlemma 2.11arxiv
6HQ24NWTRHstatementlemma 2.12arxiv
B17B13QXJTdefinitiondefinition 2.1arxiv
BMD29CN7BMstatementlemma 2.4arxiv
CVJB5H1XF5conjectureconjecture 1.1arxiv
DCBYQ8V34Dstatementcorollary 3.1arxiv
E5H8WA8FGHstatementlemma 2.3arxiv
GM64C3AZEHstatementlemma 2.8arxiv
MTN24HT7JPstatementlemma 2.1arxiv
PEHNENS4WCstatementlemma 2.13arxiv
PNEGVNB5WJstatementcorollary 2.1arxiv
QYTK0FPPR8statementlemma 2.10arxiv
RBQ3MSP8ZWstatementlemma 2.6arxiv
SB1044FGCEstatementlemma 2.5arxiv

Catalogue records