Attila Bernáth

collaborators

4 papers

math.CO2015

Blocking optimal $k$ -arborescences

Attila Bernáth, Tamás Király

Given a digraph $D = (V, A)$ and a positive integer $k$ , an arc set $F \subseteq A$ is called a \textbf{ $k$ -arborescence} if it is the disjoint union of $k$ spanning arborescences. The…

math.CO2015

Blocking unions of arborescences

Attila Bernáth, Gyula Pap

Given a digraph $D = (V, A)$ and a positive integer $k$ , a subset $B \subseteq A$ is called a \textbf{ $k$ -union-arborescence}, if it is the disjoint union of $k$ spanning arborescences…

math.CO2015

Blocking optimal arborescences

Attila Bernáth, Gyula Pap

The problem of covering minimum cost common bases of two matroids is NP-complete, even if the two matroids coincide, and the costs are all equal to 1. In this paper we show that th…

math.CO2015

A note on $V$ -free $2$ -matchings

Kristóf Bérczi, Attila Bernáth, Máté Vizer

Motivated by a conjecture of Liang [Y.-C. Liang. {\em Anti-magic labeling of graphs}. PhD thesis, National Sun Yat-sen University, 2013.], we introduce a restricted path packing pr…

Blocking optimal k-arborescences

Blocking unions of arborescences

Blocking optimal arborescences

A note on V-free 2-matchings

Blocking optimal $k$ -arborescences

A note on $V$ -free $2$ -matchings