2 papers
math.CO2026
Books versus Triangles near the n/6 Threshold
Kaizhe Chen, Jie Ma, Tianhen Wang
The book number of a graph is the maximum number of triangles sharing a common edge. A strengthening of Mantel's theorem due to Rademacher states that every -vertex g…
math.CO2024
Uniquely colorable hypergraphs
Xizhi Liu, Jie Ma, Tianhen Wang +1
An -uniform hypergraph is uniquely -colorable if there exists exactly one partition of its vertex set into parts such that every edge contains at most one vertex from eac…