Tomás Kaiser

activity

20092024

most citedReplication in critical graphs and the persistence of monomial ideals

48 citations · 133 across the 27 of their papers we have counts for

collaborators

Showing 2010Show all

2 papers · 1 filter

math.CO2010

Hamilton cycles in 5-connected line graphs

Tomáš Kaiser, Petr Vrána

A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by s…

math.CO2010

Covering a graph by forests and a matching

Tomas Kaiser, Mickael Montassier, Andre Raspaud

We prove that for any positive integer $k$ , the edges of any graph whose fractional arboricity is at most $k + 1/ (3 k + 2)$ can be decomposed into $k$ forests and a matching.