2 papers
math.CO2025
A Fan-type condition involving bipartite independence number for hamiltonicity in graphs
Hongxi Liu, Long-Tu Yuan, Xiaowen Zhang
The bipartite independence number of a graph , denoted by , is defined as the smallest integer for which there exist positive integers and with $s +…
math.CO2025
The maximum number of cliques in disjoint copies of graphs
Zhipeng Gao, Ping Li, Changhong Lu +2
The problem of determining the maximum number of copies of in an -free graph, for any graphs and , was considered by Alon and Shikhelman. This is a variant of Turán's…