1 citations · 1 across the 8 of their papers we have counts for
9 papers
On Counting Independent Sets in Regular Hypergraphs
Michail Sarantis, Prasad Tetali, Zeyu Zheng
Balogh, Bollobás and Narayanan conjectured that among all finite simple -uniform -regular hypergraphs, the number of weak independent sets is maximized by a natural quasi-bip…
The Problem Is the Problem: Towards Scalable Mathematical Discovery
Zeyu Zheng, Shengtong Zhang, Jeremy Avigad +2
AI systems are increasingly capable of contributing to mathematical research. In research practice, frontier-model reasoning is a limited resource, and expert mathematical review i…
The Oddtown problem modulo a composite number
Boris Bukh, Ting-Wei Chao, Zeyu Zheng
A family of subsets of an -element set is called an -Oddtown if the sizes of all sets are not divisible by , but the sizes of pairwise intersections ar…
The generalized trifference problem
Anurag Bishnoi, Bartłomiej Kielak, Benedek Kovács +4
We study the problem of finding the largest number of ternary vectors of length such that for any three distinct vectors there are at least coordinates where they…
On the number of edges in saturated partial embeddings of maximal planar graphs
János Barát, Zoltán L. Blázsik, Balázs Keszegh +1
We investigate the extremal properties of saturated partial plane embeddings of maximal planar graphs. For a planar graph , the plane-saturation number $\mathrm{sat}_{\mathcal{P…
Sandpile Prediction on Undirected Graphs
Ruinian Chang, Jingbang Chen, Ian Munro +3
The model is a well-known model used in exploring . Despite a large amount of work on other aspects of sandpiles, t…
Extremal planar graphs with no cycles of particular lengths
Ervin Győri, Xianzhi Wang, Zeyu Zheng
In this paper we estimate the planar Turán number of some graphs , i.e., the maximum number of edges in a planar graph of vertices not con…
Common kings of a chain of cycles in a strong tournament
Logan Post, Zeyu Zheng
It is known that every strong tournament has directed cycles of any length, and thereby strong subtournaments of any size. In this note, we prove that they also can share a common…
Note on the Turán number of the -linear hypergraph
Chaoliang Tang, Hehui Wu, Shengtong Zhang +1
Let the crown be the linear -graph on vertices with edges Proving a conjecture o…