First sub-trivial algorithms for All-Edges Sparse Triangle, Sparse Monochromatic Triangle, Exact Triangle, and 4-cycle detection using AC0 word operations.
Supersaturated graphs and hypergraphs
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Flag algebras yield sharp inducibility bounds for 36 six-vertex graphs with stability proofs in 32 cases and conjectures for 12 more.
π_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.
citing papers explorer
-
Beating Trivial Time for Tricky Triangle Tasks
First sub-trivial algorithms for All-Edges Sparse Triangle, Sparse Monochromatic Triangle, Exact Triangle, and 4-cycle detection using AC0 word operations.
-
The inducibility of 6-vertex graphs
Flag algebras yield sharp inducibility bounds for 36 six-vertex graphs with stability proofs in 32 cases and conjectures for 12 more.
-
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.