48 citations · 133 across the 27 of their papers we have counts for
34 papers
Hypertree shrinking avoiding low degree vertices
Karolína Hylasová, Tomáš Kaiser
The shrinking operation converts a hypergraph into a graph by choosing, from each hyperedge, two endvertices of a corresponding graph edge. A hypertree is a hypergraph which can be…
Rainbow bases in matroids
Florian Hörsch, Tomáš Kaiser, Matthias Kriesell
Recently, it was proved by Bérczi and Schwarcz that the problem of factorizing a matroid into rainbow bases with respect to a given partition of its ground set is algorithmically i…
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.
Graphs of low average degree without independent transversals
Carla Groenland, Tomáš Kaiser, Oscar Treffers +1
An independent transversal of a graph with a vertex partition is an independent set of intersecting each block of in a single vertex. Wanless and…
Edge-critical subgraphs of Schrijver graphs II: The general case
Tomáš Kaiser, Matěj Stehlík
We give a simple combinatorial description of an -chromatic edge-critical subgraph of the Schrijver graph , itself an induced vertex-critical subgraph o…
Quasigraphs and skeletal partitions
Tomáš Kaiser, Petr Vrána
We give a new proof of the Skeletal Lemma, which is the main technical tool in our paper on Hamilton cycles in line graphs [T. Kaiser and P. Vrána, Hamilton cycles in 5-connected l…