Another algebraic proof of Bondy's theorem on induced subsets
From MaRDI portal
Publication:1971019
DOI10.1006/jcta.1999.3013zbMath0952.05071OpenAlexW2040189504WikidataQ57522583 ScholiaQ57522583MaRDI QIDQ1971019
Publication date: 28 December 2000
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/36019ea9339d94c9ba56de2a39bd7f465bc8dce4
Related Items (5)
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets ⋮ Rounds in combinatorial search ⋮ Two proofs of Bondy's theorem on induced subsets and two related questions ⋮ Inclusionwise minimal completely separating systems ⋮ Intersection patterns of linear subspaces with the hypercube
Cites Work
This page was built for publication: Another algebraic proof of Bondy's theorem on induced subsets