Dara Zirlin

activity

20182022

2 ℓ + 1

vertices are

ℓ

-recognizable

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

collaborators

8 papers

math.CO2022

Saturation for the $3$ -uniform loose $3$ -cycle

Sean English, Alexandr Kostochka, Dara Zirlin

Let $F$ and $H$ be $k$ -uniform hypergraphs. We say $H$ is $F$ -saturated if $H$ does not contain a subgraph isomorphic to $F$ , but $H + e$ does for any hyperedge $e \neq \in E (H)$ . The…

math.CO2021★ 2 cited

Acyclic graphs with at least $2 ℓ + 1$ vertices are $ℓ$ -recognizable

Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1

The $(n - ℓ)$ -deck of an $n$ -vertex graph is the multiset of subgraphs obtained from it by deleting $ℓ$ vertices. A family of $n$ -vertex graphs is $ℓ$ -recognizable if every…

math.CO2020

Conditions for a bigraph to be super-cyclic

Alexandr Kostochka, Mikhail Lavrov, Ruth Luo +1

A hypergraph $H$ is super-pancyclic if for each $A \subseteq V (H)$ with $∣ A ∣ \geq 3$ , $H$ contains a Berge cycle with base vertex set $A$ . We present two…

math.CO2020

Longest cycles in 3-connected hypergraphs and bipartite graphs

Alexandr Kostochka, Mikhail Lavrov, Ruth Luo +1

In the language of hypergraphs, our main result is a Dirac-type bound: we prove that every $3$ -connected hypergraph $H$ with $δ (H) \geq max {∣ V (H) ∣, \frac{∣ E ( H ) ∣ + 10}{4}}$ has a h…

math.CO2019

3-Regular Graphs Are 2-Reconstructible

Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1

A graph is $ℓ$ -reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $ℓ$ vertices. We prove that $3$ -regular graphs are $2$ -reconstruc…

math.CO2019

Super-pancyclic hypergraphs and bipartite graphs

Alexandr Kostochka, Ruth Luo, Dara Zirlin

We find Dirac-type sufficient conditions for a hypergraph $H$ with few edges to be hamiltonian. We also show that these conditions provide that $H$ is {\em super-…