Alexandr V. Kostochka

most citedAcyclic graphs with at least

2 ℓ + 1

vertices are

ℓ

-recognizable

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

collaborators

3 papers

math.CO2022

Sharp lower bounds for the number of maximum matchings in bipartite multigraphs

Alexandr V. Kostochka, Douglas B. West, Zimu Xiang

We study the minimum number of maximum matchings in a bipartite multigraph G with parts $X$ and $Y$ under various conditions, refining the well-known lower bound due to M. Hall. Wh…

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…

Sharp lower bounds for the number of maximum matchings in bipartite multigraphs

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