Answers are grounded in this paper and cite their sources.
Exploration of Clique Density Implications for Larger Blowups in Ordered Graphs, Highlighting New Findings.
A well-known theorem of Nikiforov asserts that any graph with a positive Kᵣ -density contains a logarithmic blowup of Kᵣ . In this paper, we explore variants of Nikiforov’s result in the following form. Given r,t∈ N , when a positive Kᵣ -density implies the existence of a significantly larger (with almost linear size) blowup of Kₜ ? Our results include: • For an n -vertex ordered graph G with no induced monotone path P₆ , if its complement Ḡ has positive triangle density, then Ḡ contains a biclique of size Ω (n log n) . This strengthens a recent result of Pach and Tomon. For general k , let $g(k)$ be the minimum r∈ N such that for any n -vertex ordered graph G with no induced monotone P₂ₖ , if Ḡ has positive Kᵣ -density, then Ḡ contains a biclique of size <jats:inline-graphic xmlns:xlink="http://www.w3.org/19
No takes yet. Share an insight, caveat, or question.
Bradač et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: