15 papers
On the difference between clique partition and clique covering numbers of graphs
Bo Ning
For a graph , let $\cpn(G)$ and $\ccn(G)$ denote the minimum numbers of cliques whose edge sets partition and cover , respectively, and put $f(n)=\max_{|V(G)|=n}\bigl(\cpn…
Kohayakawa's conjecture and clique coverings of complements of paths and cycles
Bo Ning
For , let be the bipartite graph between the -subsets and the -subsets of , where adjacency means disjointness, and let be the maximum number of…
Nikiforov's spectral consecutive cycle problem and the connected-matching method
Bo Ning, Mingqing Zhai
Let denote the adjacency spectral radius of a graph of order . We determine the sharp constant in an open problem of Nikiforov (2008) on cycles of consecutive length…
Cycle lengths and chords under chromatic and degree constraints
Xiaozheng Chen, Bo Ning
We mainly consider three problems on cycle lengths and cycles with chords in graphs: (a) Gao, Huo, and Ma \cite[Question~1.5]{GaoHuoMa2021} asked whether, for every fixed ,…
Extensions of Erdős's 1962 theorem on non-Hamiltonian graphs
Xu Liu, Bo Ning, Tao Wang
For a positive integer , a graph property , and a graph parameter , let denote the maximum v…
Two problems of Burr, Erd\H os, Graham, and Sós on maximal anti-Ramsey functions for
Mingze Li, Bo Ning, Tianying Xie
Burr, Erd\H os, Graham, and Sós introduced the maximal anti-Ramsey function , the minimum number of colors required over all -vertex graphs with at leas…