The paper generalizes the blow-up operation from graphs to arbitrary combinatorial objects and outlines possible uses.
”A simple proof that the edge density of Fon-der-Flaass (3,4)-graph is≥ 7 16 (1−o(1))”
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Blow-up trick in Combinatorics
The paper generalizes the blow-up operation from graphs to arbitrary combinatorial objects and outlines possible uses.