2 papers
math.CO2026
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…
math.CO2023
Phase Transitions of Structured Codes of Graphs
Bo Bai, Yu Gao, Jie Ma +1
We consider the symmetric difference of two graphs on the same vertex set , which is the graph on whose edge set consists of all edges that belong to exactly one of the…