Characterizing and generalizing cycle completable graphs
Combinatorics
2023-09-06 v2
Abstract
The family of cycle completable graphs has several cryptomorphic descriptions, the equivalence of which has heretofore been proven by a laborious implication-cycle that detours through a motivating matrix completion problem. We give a concise proof, partially by introducing a new characterization. Then we generalize this family to ``-quasichordal'' graphs, with three natural characterizations.
Keywords
Cite
@article{arxiv.2304.09335,
title = {Characterizing and generalizing cycle completable graphs},
author = {Maria Chudnovsky and Ian Malcolm Johnson McInnis},
journal= {arXiv preprint arXiv:2304.09335},
year = {2023}
}
Comments
8 pages