M. Nahvi

activity

20172023

2 ℓ + 1

vertices are

ℓ

-recognizable

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

collaborators

Showing math.COShow all

9 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…

math.CO2023

Saturation Numbers for Berge Cliques

Sean English, Jürgen Kritschgau, Mina Nahvi +1

Let $F$ be a graph and $H$ be a hypergraph, both embedded on the same vertex set. We say $H$ is a Berge- $F$ if there exists a bijection $ϕ:E(F)\to E(\mathcal{H}…

math.CO2021

On sizes of 1-cross intersecting set pair systems

Alexandr V. Kostochka, Grace McCourt, Mina Nahvi

Let ${(A_{i}, B_{i})}_{i = 1}^{m}$ be a set pair system. Füredi, Gyárfás and Király called it {\em $1$ -cross intersecting} if $∣ A_{i} \cap B_{j} ∣$ is $1$ when $i \neq = j$ and $0$ if $i = j$ . They…

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

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

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

Saturation Numbers for Berge Cliques

On sizes of 1-cross intersecting set pair systems

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

3-Regular Graphs Are 2-Reconstructible

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