17 citations · 57 across the 36 of their papers we have counts for
5 papers · 1 filter
Complete graph immersions and minimum degree
Zdeněk Dvořák, Liana Yepremyan
An immersion of a graph H in another graph G is a one-to-one mapping phi:V(H)->V(G) and a collection of edge-disjoint paths in G, one for each edge of H, such that the path P_{uv}…
Turán numbers of extensions
Sergey Norin, Liana Yepremyan
The extension of an -uniform hypergraph is obtained from it by adding for every pair of vertices of , which is not covered by an edge in , an extra edge containing thi…
The extremal function for disconnected minors
Endre Csóka, Irene Lo, Sergey Norin +2
For a graph let denote the supremum of taken over all non-null graphs not containing as a minor. We show that $$c(H) \leq \frac{|V(H)|+\mathrm{co…
The Characterization of planar, 4-connected, K_{2,5}-minor-free graphs
Emily Abernethy Marshall, Liana Yepremyan, Zach Gaslowitz
We show that every planar, 4-connected, K2;5-minor- free graph is the square of a cycle of even length at least six.
Turán Number of Generalized Triangles
Sergey Norin, Liana Yepremyan
The family consists of all -graphs with three edges such that and . A generalized triangle, $\mathcal{T}…