University of West Bohemia in Pilsen

output

20042026

most citedSciPy 1.0--Fundamental Algorithms for Scientific Computing in Python

40.2k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2019 · math.COShow all

3 papers · 2 filters

math.CO2019★ 10 cited

No additional tournaments are quasirandom-forcing

Robert Hancock, Adam Kabela, Daniel Kral +4

A tournament H is quasirandom-forcing if the following holds for every sequence (G_n) of tournaments of growing orders: if the density of H in G_n converges to the expected density…

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

On forbidden induced subgraphs for K_{1,3}-free perfect graphs

Christoph Brause, Přemysl Holub, Adam Kabela +3

Considering connected $K_{1, 3}$ -free graphs with independence number at least $3$ , Chudnovsky and Seymour (2010) showed that every such graph, say $G$ , is $2 ω$ -colourable where $ω$ …