20 citations · 52 across the 11 of their papers we have counts for
21 papers
Testability and local certification of monotone properties in minor-closed classes
Louis Esperet, Sergey Norin
The main problem in the area of graph property testing is to understand which graph properties are \emph{testable}, which means that with constantly many queries to any input graph…
Typical structure of hereditary properties of binary matroids
Stefan Grosser, Hamed Hatami, Peter Nelson +1
We prove an arithmetic analogue of the typical structure theorem for graph hereditary properties due to Alon, Balogh, Bollobás and Morris.
Densities of minor-closed graph classes are rational
Rohan Kapadia, Sergey Norin
For a graph class , let denote the maximum number of edges in a graph in on vertices. We show that for every proper minor-close…
The inducibility of oriented stars
Ping Hu, Jie Ma, Sergey Norin +1
We consider the problem of maximizing the number of induced copies of an oriented star in digraphs of given size, where the center of the star has out-degree and i…
Typical structure of hereditary graph families. II. Exotic examples
Sergey Norin, Yelena Yuditsky
A graph is -free if it does not contain an induced subgraph isomorphic to . The study of the typical structure of -free graphs was initiated by Erdős, Kleitman and Rot…
Typical structure of hereditary graph families. I. Apex-free families
Sergey Norin, Yelena Yuditsky
A family of graphs is hereditary if is closed under isomorphism and taking induced subgraphs. The speed of is the sequence $\{|\mathcal{F}…