2 citations · 2 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2025
New lower bounds on the non-repetitive chromatic number of some graphs
Tianyi Tao, Junchi Zhang, Wentao Zhang +1
A graph \( G \) is said to be (vertex) non-repetitively colored if no simple path in \( G \) has a sequence of vertex colors that forms a repetition. Formally, a coloring \( c: V(G…
math.CO2025
Maximum in-general-position set in a random subset of
Yaobin Chen, Jiaxi Nie, Jing Yu +1
Let be the maximum possible size of a point set in general position in a -random subset of . We determine the order of magnitude of $α(\m…
math.CO2020★ 2 cited
The Betti Number of the Independence Complex of Ternary Graphs
Hehui Wu, Wentao Zhang
Given a graph , the \textit{independence complex} is the simplicial complex whose faces are the independent sets of . Let denote the -th reduced Be…