14 citations · 26 across the 13 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2020
Covering minimal separators and potential maximal cliques in -free graphs
Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk +1
A graph is called -free} if it does not contain a -vertex path as an induced subgraph. While -free graphs are exactly cographs, the structure of -free graphs for…
cs.DM2014★ 1 cited
Densities in large permutations and parameter testing
Roman Glebov, Carlos Hoppen, Tereza Klimosova +3
A classical theorem of Erdos, Lovasz and Spencer asserts that the densities of connected subgraphs in large graphs are independent. We prove an analogue of this theorem for permuta…
cs.DM2012
Hereditary properties of permutations are strongly testable
Tereza Klimosova, Daniel Kral
We show that for every hereditary permutation property P and every eps>0, there exists an integer M such that if a permutation p is eps-far from P in the Kendall's tau distance, th…