Dara Zirlin

activity

20182023

2 ℓ + 1

vertices are

ℓ

-recognizable

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

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023

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.CO2023

Trees with at least $6 ℓ + 11$ vertices are $ℓ$ -reconstructible

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

The $(n - ℓ)$ -deck of an $n$ -vertex graph is the multiset of (unlabeled) subgraphs obtained from it by deleting $ℓ$ vertices. An $n$ -vertex graph is $ℓ$ -reconstructible if i…

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

Trees with at least 6ℓ+11 vertices are ℓ-reconstructible

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

Trees with at least $6 ℓ + 11$ vertices are $ℓ$ -reconstructible