preprint · 2018
Rational exponents in extremal graph theory
Given a family of graphs \mathcal{H} , the extremal number ex (n, \mathcal{H}) is the largest m for which there exists a graph with n vertices and m edges co...
9 citationsDOI: https://doi.org/10.4171/jems/798Open accessPDF reported by metadata