M. Nahvi

activity

20162023

2 ℓ + 1

vertices are

ℓ

-recognizable

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

collaborators

Showing 2021Show all

2 papers · 1 filter

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…

On sizes of 1-cross intersecting set pair systems

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

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