7 papers · 1 filter
Longest cycles and Dirac-type results in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
A classical theorem of Nash-Williams states that if is a -connected graph on vertices with minimum degree at least , then for every longest cycle of , th…
Almost Affine Invariance Over Prime Fields: Green Problem 90
Jie Ma, Quanyu Tang, Max Wenqiang Xu
Let with density 1/2. We call a set almost affine invariant under an affine transformation if \[|A \triangle ϕ(A)| =o(p).\] We determine tha…
On Spielman's Laplacian Eigenratio Conjecture and Related Problems
Jie Ma, Quanyu Tang, Yuchang Wang +1
Let be an -vertex graph with Laplacian eigenvalues . Motivated by the Alon-Boppana bound and the Ramanujan phenomenon for regular grap…
Hypergraphs without Subgraphs of Given Connectivity
Jie Ma, Shengjie Xie, Zhiheng Zheng
In this paper, we study the problem of determining the maximum number of edges in an -vertex -uniform hypergraph that contains no -connected subgraph. The g…
On a maximal anti-Ramsey conjecture of Burr, Erdős, Graham, and Sós
Matija Bucic, Kaizhe Chen, Jie Ma
Given a graph , the maximal anti-Ramsey function denotes the minimum integer for which there exists an -vertex graph with at least edges admitting an e…
Largest Sidon subsets in weak Sidon sets
Jie Ma, Quanyu Tang
A finite set is called a Sidon set if all sums with and are distinct, and a weak Sidon set if all sums with $ x,y…
Towards the Erdős matching conjecture for 4-uniform hypergraphs: stability and applications
Peter Frankl, Hongliang Lu, Jie Ma +1
A famous conjecture of Erdős asserts that for , the maximum number of edges in an -vertex -uniform hypergraph without pairwise disjoint edges is $\max\{\binom{n…