Resolves the maximum number of distance-3 pairs without forming a triangle and completely characterizes extremal graphs for distance-2 pairs in n-vertex graphs.
Title resolution pending
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
-
Tur\'an-Type Extremal Results for Distance-$k$ Graphs
Resolves the maximum number of distance-3 pairs without forming a triangle and completely characterizes extremal graphs for distance-2 pairs in n-vertex graphs.