π_link(t) ≤ 1 - t^{-1} - t^{-2}/12 for every t ≥ 2, which determines the order of the gap to the trivial bound 1 - t^{-1} up to a constant factor when paired with Goldwasser's lower bound for prime-power t-1.
On the structure of linear graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
New extremal edge bounds are proved for K3-free (3n-8), K4-free (floor(7n/2)-7), and K5-free (4n-8) 1-planar graphs, with tightness for large n.
citing papers explorer
-
A note on the $t$-partite link problem of F\"uredi
π_link(t) ≤ 1 - t^{-1} - t^{-2}/12 for every t ≥ 2, which determines the order of the gap to the trivial bound 1 - t^{-1} up to a constant factor when paired with Goldwasser's lower bound for prime-power t-1.
-
Extremal 1-planar graphs without k-cliques
New extremal edge bounds are proved for K3-free (3n-8), K4-free (floor(7n/2)-7), and K5-free (4n-8) 1-planar graphs, with tightness for large n.