48 citations · 133 across the 27 of their papers we have counts for
4 papers · 1 filter
A short proof of the tree-packing theorem
Tomáš Kaiser
We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k edge-disjoint spanning trees.
Fractional total colourings of graphs of high girth
Tomas Kaiser, Andrew King, Daniel Kral
Reed conjectured that for every epsilon>0 and Delta there exists g such that the fractional total chromatic number of a graph with maximum degree Delta and girth at least g is at m…
Short Cycle Covers of Cubic Graphs and Graphs with Minimum Degree Three
Tomas Kaiser, Daniel Kral, Bernard Lidicky +2
The Shortest Cycle Cover Conjecture of Alon and Tarsi asserts that the edges of every bridgeless graph with edges can be covered by cycles of total length at most …
A note on edge-colourings avoiding rainbow K_4 and monochromatic K_m
Veselin Jungic, Tomas Kaiser, Daniel Kral
We study the mixed Ramsey number maxR(n,K_m,K_r), defined as the maximum number of colours in an edge-colouring of the complete graph K_n, such that K_n has no monochromatic comple…