3 papers
math.CO2026
Bounded chromatic number of graphs with small clique number and large minimum degree
Jiaao Li, Xinyuan Li
We prove that every triangle-free graph with minimum degree at least is -colorable and thereby settle a problem of Brandt and Thomassé (2005) at the threshold $\fr…
math.CO2026
Nowhere-zero -flows in graphs with forbidden edge-cuts
Jiaao Li, Xinyuan Li
Tutte's -flow conjecture asserts that every -edge-connected graph admits a nowhere-zero -flow. In 2013, Lovász, Thomassen, Wu, and Zhang proved that every odd--edge-con…
math.CO2025
Realizing degree sequences with -connected graphs
Rui Guan, Chenglin Jiang, Hong-Jian Lai +2
A graph is -connected if, for any mapping with , there exists a strongly connected orientati…