1 problem
- 0 votes0 replies0 views
The logarithmic-range conjecture for regular-graph upper tails
Upper-tail conjecture. The conclusion of Theorem remains true under this weaker assumption: if is nonbipartite, then
The logarithmic-range conjecture for regular-graph upper tails
Upper-tail conjecture. The conclusion of Theorem remains true under this weaker assumption: if is nonbipartite, then