期刊： COMBINATORICS PROBABILITY & COMPUTING, 2021; 30 (2)
Bollobas and Nikiforov (J. Combin. Theory Ser. B. 97 (2007) 859-865) conjectured the following. If G is a Kr+1-free graph on at least r + 1 vertices a......
期刊： COMBINATORICS PROBABILITY & COMPUTING, 2020; 29 (4)
In this paper we develop an in-depth analysis of non-reversible Markov chains on denumerable state space from a similarity orbit perspective. In parti......
期刊： COMBINATORICS PROBABILITY & COMPUTING, 2020; 29 (1)
The famous Erdos-Gallai theorem on the Turan number of paths states that every graph with n vertices and m edges contains a path with at least (2m)/n ......
期刊： COMBINATORICS PROBABILITY & COMPUTING, 2019; 28 (5)
For an edge-coloured graph G, the minimum colour degree of G means the minimum number of colours on edges which are incident to each vertex of G. We p......
期刊： COMBINATORICS PROBABILITY & COMPUTING, 2018; 27 (5)
We derive an optimal eigenvalue ratio estimate for finite weighted graphs satisfying the curvature-dimension inequality CD(0, infinity). This estimate......
期刊： COMBINATORICS PROBABILITY & COMPUTING, 2018; 27 (1)
Bollobas and Scott (Random Struct. Alg. 21 (2002) 414-430) asked for conditions that guarantee a bisection of a graph with m edges in which each class......
期刊： COMBINATORICS PROBABILITY & COMPUTING, 2017; 26 (2)
Judicious partitioning problems on graphs and hypergraphs ask for partitions that optimize several quantities simultaneously. Let k >= 2 be an inte......
