Matej Stehlík

activity

20092026

most citedReplication in critical graphs and the persistence of monomial ideals

48 citations · 102 across the 14 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019★ 7 cited

Edge-critical subgraphs of Schrijver graphs

Tomáš Kaiser, Matěj Stehlík

For $k \geq 1$ and $n \geq 2 k$ , the Kneser graph $K G (n, k)$ has all $k$ -element subsets of an $n$ -element set as vertices; two such subsets are adjacent if they are disjoint. It was f…

math.CO2019★ 1 cited

Bipartite complements of circle graphs

Louis Esperet, Matěj Stehlík

Using an algebraic characterization of circle graphs, Bouchet proved in 1999 that if a bipartite graph $G$ is the complement of a circle graph, then $G$ is a circle graph. We give…