14 citations · 26 across the 13 of their papers we have counts for
10 papers · 1 filter
Antipaths in oriented graphs
Tereza Klimošová, Maya Stein
We show that for any natural number , any oriented graph of minimum semidegree at least contains an antidirected path of length . In fact, a slightly we…
On Vizing's edge colouring question
Marthe Bonamy, Oscar Defrain, Tereza Klimošová +2
Soon after his 1964 seminal paper on edge colouring, Vizing asked the following question: can an optimal edge colouring be reached from any given proper edge colouring through a se…
Sandwiching biregular random graphs
Tereza Klimošová, Christian Reiher, Andrzej Ruciński +1
Let be a uniformly random -edge subgraph of the complete bipartite graph with bipartition , where . Given a real number $p \in [0,1…
Counterexamples to Thomassen's conjecture on decomposition of cubic graphs
Thomas Bellitto, Tereza Klimošová, Martin Merker +2
We construct an infinite family of counterexamples to Thomassen's conjecture that the vertices of every 3-connected, cubic graph on at least 8 vertices can be colored blue and red…
Edge-partitioning 3-edge-connected graphs into paths
Tereza Klimošová, Stéphan Thomassé
We show that for every l, there exists d_l such that every 3-edge-connected graph with minimum degree d_l can be edge-partitioned into paths of length l (provided that its number o…
Edge-decomposing graphs into coprime forests
Tereza Klimošová, Stéphan Thomassé
The Barat-Thomassen conjecture, recently proved in [Bensmail et al.: A proof of the Barat-Thomassen conjecture. J. Combin. Theory Ser. B, 124:39-55, 2017.], asserts that for every…
Infinite dimensional finitely forcible graphon
Roman Glebov, Tereza Klimosova, Daniel Kral
Graphons are analytic objects associated with convergent sequences of dense graphs. Finitely forcible graphons, i.e., those determined by finitely many subgraph densities, are of p…
Immersion in four-edge-connected graphs
Maria Chudnovsky, Zdeněk Dvořák, Tereza Klimošová +1
Fix g>1. Every graph of large enough tree-width contains a g x g grid as a minor; but here we prove that every four-edge-connected graph of large enough tree-width contains a g x g…
Finitely forcible graphons and permutons
Roman Glebov, Andrzej Grzesik, Tereza Klimosova +1
We investigate when limits of graphs (graphons) and permutations (permutons) are uniquely determined by finitely many densities of their substructures, i.e., when they are finitely…
Strong immersions and maximum degree
Zdenek Dvorak, Tereza Klimosova
A graph H is strongly immersed in G if G is obtained from H by a sequence of vertex splittings (i.e., lifting some pairs of incident edges and removing the vertex) and edge removal…