Rohan Kapadia

activity

20132020

most citedAsymptotic Density of Graphs Excluding Disconnected Minors

2 citations · 3 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2020

Densities of minor-closed graph classes are rational

Rohan Kapadia, Sergey Norin

For a graph class $F$ , let $e x_{F} (n)$ denote the maximum number of edges in a graph in $F$ on $n$ vertices. We show that for every proper minor-close…

math.CO2019★ 2 cited

Asymptotic Density of Graphs Excluding Disconnected Minors

Rohan Kapadia, Sergey Norin, Yingjie Qian

For a graph $H$ , let $c_{\infty} (H) = n \to \infty lim max \frac{∣ E ( G ) ∣}{n},$ where the maximum is taken over all graphs $G$ on $n$ vertices not containing $H$ as a minor. Thus…

math.CO2013★ 1 cited

Representation of matroids with a modular plane

Jim Geelen, Rohan Kapadia

We prove that if M is a vertically 4-connected matroid with a modular flat X of rank at least three, then every representation of M | X over a finite field F extends to a unique F-…