Leila Badakhshian

most citedThe domination number of the graph defined by two levels of the

n

-cube, II

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

collaborators

2 papers

math.CO2023★ 1 cited

On density conditions for transversal trees in multipartite graphs

Leila Badakhshian, Victor Falgas-Ravry, Maryam Sharifzadeh

Let $G$ be an $r$ -partite graph such that the edge density between any two parts is at least $α$ . How large does $α$ need to be to guarantee that $G$ contains a connected transvers…

math.CO2019★ 1 cited

The domination number of the graph defined by two levels of the $n$ -cube, II

József Balogh, Gyula O. H. Katona, William Linz +1

Consider all $k$ -element subsets and $ℓ$ -element subsets $(k > ℓ)$ of an $n$ -element set as vertices of a bipartite graph. Two vertices are adjacent if the corresponding $\ell…

On density conditions for transversal trees in multipartite graphs

The domination number of the graph defined by two levels of the n-cube, II

The domination number of the graph defined by two levels of the $n$ -cube, II