7 papers
The list coloring number of uncrowded hypergraphs
Jing Yu, Junchi Zhang
We prove that for every fixed integer and every , every sufficiently large finite uncrowded -uniform hypergraph of maximum degree has list chro…
PhaseWin: An Efficient Search Algorithm for Faithful Visual Attribution
Zihan Gu, Junchi Zhang, Li Liu +2
Visual attribution is a fundamental tool for interpreting modern vision and vision-language models, particularly when their decisions must be inspected, diagnosed, or audited. Its…
On independent sets in uncrowded uniform hypergraphs
Jing Yu, Junchi Zhang
We prove an average-degree lower bound on the independence number of uncrowded uniform hypergraphs. For every fixed and every , there exists such th…
Hypergraph independence bounds: from maximum degree to average degree
Jing Yu, Junchi Zhang
We prove a transfer theorem for hereditary classes of -uniform hypergraphs. Let be such a class, and for write and for the maxim…
The linear Turán number of the 3-graph
Chaoliang Tang, Hehui Wu, Junchi Zhang
We prove that for any linear 3-graph on vertices without a path of length 5, the number of edges is at most , and the equality holds if and only if the graph is…
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…