Mihir Neve

collaborators

4 papers

math.CO2026

Range of Clique Counts in Graphs

Mihir Neve, Alexey Pokrovskiy, Andrey Shapiro

Let $γ (G)$ denote the number of cliques in a graph $G$ and let $Γ (n) := {γ (G) : ∣ V (G) ∣ = n}$ be the set of values of $γ (G)$ that can be attained on $n$ vertices. We improve on a resul…

math.CO2026

Local Resilience for Containment of Bounded Degree Spanning Subgraphs

Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1

We prove that for all $Δ \geq 2$ and $γ > 0$ , there exists a constant $C = C (Δ, γ)$ such that for $p \geq C (lo g n / n)^{1/Δ}$ , asymptotically almost surely, every spanning subgraph $G$ …

math.CO2026

Spanning tight components in 4-uniform hypergraphs

Francesco Di Braccio, Brian Hearn, Joanna Lada +2

We prove that every $n$ -vertex 4-uniform hypergraph with minimum codegree at least $⌊ n /4 ⌋$ has a spanning tight component. This is tight, and it settles the 4-uniform…

math.CO2025

Robustness of the Sauer-Spencer Theorem

Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1

We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define $G (p)$ to be a random subgraph of $G$ obtained by retaining e…