8 papers
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…
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{…
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 t…
An exponential improvement for Ramsey lower bounds
Jie Ma, Wujie Shen, Shengjie Xie
We prove a new lower bound on the Ramsey number for any constant and sufficiently large , showing that there exists s…
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 g…