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 2014 · math.COShow all

5 papers · 2 filters

math.CO2014★ 7 cited

Induced subgraphs with large degrees at end-vertices for hamiltonicity of claw-free graphs

Roman Čada, Binlong Li, Bo Ning +1

A graph is called \emph{claw-free} if it contains no induced subgraph isomorphic to $K_{1, 3}$ . Matthews and Sumner proved that a 2-connected claw-free graph $G$ is hamiltonian if e…

math.CO2014★ 1 cited

Solution to a problem on hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions

Bo Ning, Shenggui Zhang, Binlong Li

A graph $G$ is called \emph{claw-o-heavy} if every induced claw ( $K_{1, 3}$ ) of $G$ has two end-vertices with degree sum at least $∣ V (G) ∣$ in $G$ . For a given graph $R$ , $G$ is call…

math.CO2014★ 1 cited

Fractional covers and matchings in families of weighted $d$ -intervals

Ron Aharoni, Tomas Kaiser, Shira Zerbib

A $d$ -{\em interval} is a union of at most $d$ disjoint closed intervals on a fixed line. Tardos [Combinatorica 15 (1995), 123-134] and the second author [Disc. Comput. Geom. 18 (1…

math.CO2014★ 20 cited

A density Corrádi-Hajnal Theorem

Peter Allen, Julia Böttcher, Jan Hladký +1

We find, for all sufficiently large $n$ and each $k$ , the maximum number of edges in an $n$ -vertex graph which does not contain $k + 1$ vertex-disjoint triangles. This extends a resu…

math.CO2014

On path-quasar Ramsey numbers

Binlong Li, Bo Ning

Let $G_{1}$ and $G_{2}$ be two given graphs. The Ramsey number $R (G_{1}, G_{2})$ is the least integer $r$ such that for every graph $G$ on $r$ vertices, either $G$ contains a $G_{1}$ or $\ove…

Induced subgraphs with large degrees at end-vertices for hamiltonicity of claw-free graphs

Solution to a problem on hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions

Fractional covers and matchings in families of weighted d-intervals

A density Corrádi-Hajnal Theorem

On path-quasar Ramsey numbers

Fractional covers and matchings in families of weighted $d$ -intervals