3 papers
math.CO2023
Packing -connectors in graphs needs more connectivity
Roman Čada, Adam Kabela, Tomáš Kaiser +1
Strengthening the classical concept of Steiner trees, West and Wu [J. Combin. Theory Ser. B 102 (2012), 186--205] introduced the notion of a -connector in a graph with a set…
math.CO2022
Hamilton cycles in line graphs of 3-hypergraphs
Tomáš Kaiser, Petr Vrána
We prove that every 52-connected line graph of a rank 3 hypergraph is Hamiltonian. This is the first result of this type for hypergraphs of bounded rank other than ordinary graphs.
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…