Tight bounds and conjectures for the isolation lemma

DOI10.4310/JOC.2018.v9.n3.a2zbMath1387.05196arXiv1604.07035WikidataQ123119356 ScholiaQ123119356MaRDI QIDQ1750661

Vance Faber, David G. Harris

Publication date: 23 May 2018

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.07035

zbMATH Keywords

matchingisolation lemma

Mathematics Subject Classification ID

Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)

Related Items (1)

Bipartite Perfect Matching is in Quasi-NC

This page was built for publication: Tight bounds and conjectures for the isolation lemma