Constructs new families of regular graphs with the MMS property, identifies high-probability regimes in Erdős–Rényi graphs, and extends sufficient conditions to hypergraphs using pseudo-matchings and blowout constructions.
Asymptotic behavior of the chromatic index for hypergraphs.Journal of Combinatorial Theory, Series A, 51(1):24–42, 1989
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
An auxiliary-fermion encoding removes Jordan-Wigner strings for sparse non-local fermion models, achieving asymptotically optimal Trotter circuit depth on qubits after one-time state preparation.
citing papers explorer
-
The Manickam-Mikl\'os-Singhi Property in Graphs and Hypergraphs
Constructs new families of regular graphs with the MMS property, identifies high-probability regimes in Erdős–Rényi graphs, and extends sufficient conditions to hypergraphs using pseudo-matchings and blowout constructions.
-
Efficient Simulation of Sparse, Non-Local Fermion Models
An auxiliary-fermion encoding removes Jordan-Wigner strings for sparse non-local fermion models, achieving asymptotically optimal Trotter circuit depth on qubits after one-time state preparation.