7 papers
Bisections of graphs under degree constraints
Jie Ma, Hehui Wu
In this paper, we investigate the problem of finding {\it bisections} (i.e., balanced bipartitions) in graphs. We prove the following two results for {\it all} graphs : (1). …
An ErdÅs problem on random subset sums in finite abelian groups
Jie Ma, Quanyu Tang
Let denote the least integer such that, if is an abelian group of order and is a uniformly random -element subset, then with probability at le…
Leaf-to-leaf paths and cycles in degree-critical graphs
Francesco Di Braccio, Kyriakos Katsamaktsis, Jie Ma +2
An -vertex graph is degree 3-critical if it has edges and no proper induced subgraph with minimum degree at least 3. In 1988, ErdÅs, Faudree, Gyárfás, and Schelp ask…
Dean's conjecture and cycles modulo k
Yufan Luo, Jie Ma, Ziyuan Zhao
Dean conjectured three decades ago that every graph with minimum degree at least contains a cycle whose length is divisible by . While the conjecture has been verified…
Spectral supersaturation for color-critical graphs
Longfei Fang, Yongtao Li, Huiqiu Lin +1
A graph is color-critical if it contains an edge whose deletion reduces its chromatic number. This class of graphs, including cliques and odd cycles, plays a central role in extrem…
Proof of a conjecture of Voss on bridges of longest cycles
Jie Ma, Rongxing Xu
Bridges are a classical concept in structural graph theory and play a fundamental role in the study of cycles. A conjecture of Voss from 1991 asserts that if disjoint bridges $B_1,…