2 citations · 3 across the 4 of their papers we have counts for
10 papers
Hypergraph universality via branching random walks
Rajko Nenadov
Given a family of hypergraphs , we say that a hypergraph is -universal if it contains every as a subgraph. For $D, r \in \mathbb{N…
The number of arcs in of a given cardinality
Rajko Nenadov
A subset of is called an arc if it does not contain three collinear points. We show that there are at most arcs of size $m \gg q^{1/2} (\l…
Counting sparse induced subgraphs in locally dense graphs
Rajko Nenadov
An -vertex graph is locally dense if every induced subgraph of size larger than has density at least , for some parameters . We show that the number of…
The largest subgraph without a forbidden induced subgraph
Jacob Fox, Rajko Nenadov, Huy Tuan Pham
We initiate the systematic study of the following Turán-type question. Suppose is a graph with vertices such that the edge density between any pair of subsets of vertices o…
The Hamilton space of pseudorandom graphs
Micha Christoph, Rajko Nenadov, Kalina Petrova
We show that if is odd and , then with high probability Hamilton cycles in span its cycle space. More generally, we show this holds for a class of…
Edge-disjoint paths in expanders: online with removals
Nemanja Draganić, Rajko Nenadov
We consider the problem of finding edge-disjoint paths between given pairs of vertices in a sufficiently strong -regular expander graph with vertices. In particular, we…