Establishes the sharp bound a(G)−α(G)≤2μ(G)+1−⌈√(6μ(G))⌉ attained for all μ(G)≥1, plus matching-dependent bounds for forests/bipartite/König-Egerváry graphs and an independent proof of α(G)≥(a(G)+res(G))/Δ(G) for connected G with n≥3.
DeLaViña,Some history of the development of Graffiti, in: S
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2verdicts
UNVERDICTED 2representative citing papers
TxGraffiti is a data-driven heuristic program for generating conjectures in graph theory, with a new web interface for interactive exploration.
citing papers explorer
-
Annihilation, Independence, and Residue: Sharp Matching Bounds for the Annihilation Gap and a TxGraffiti Application
Establishes the sharp bound a(G)−α(G)≤2μ(G)+1−⌈√(6μ(G))⌉ attained for all μ(G)≥1, plus matching-dependent bounds for forests/bipartite/König-Egerváry graphs and an independent proof of α(G)≥(a(G)+res(G))/Δ(G) for connected G with n≥3.
-
Automated conjecturing with \emph{TxGraffiti}
TxGraffiti is a data-driven heuristic program for generating conjectures in graph theory, with a new web interface for interactive exploration.