Another Algebraic Proof of Bondy's Theorem on Induced Subsets

Andreas Winter

doi:10.1006/jcta.1999.3013

Another Algebraic Proof of Bondy's Theorem on Induced Subsets

Andreas Winter

Universität Bielefeld

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

Bondy proved in 1972 that, given a family of n distinct substes of a set X of n elements, one can delete an element of X such that the truncated sets remain distinct. We give a linear algebraic proof of this result and generalize it to codes of minimal distance d.

Original language	English
Pages (from-to)	145-147
Number of pages	3
Journal	Journal of Combinatorial Theory, Series A
Volume	89
Issue number	1
DOIs	https://doi.org/10.1006/jcta.1999.3013
State	Published - Jan 2000
Externally published	Yes

Keywords

Bondy's theorem; linear algebra

Access to Document

10.1006/jcta.1999.3013

Cite this

@article{43a62fcb1b714079ab71f6cccdf94775,

title = "Another Algebraic Proof of Bondy's Theorem on Induced Subsets",

abstract = "Bondy proved in 1972 that, given a family of n distinct substes of a set X of n elements, one can delete an element of X such that the truncated sets remain distinct. We give a linear algebraic proof of this result and generalize it to codes of minimal distance d.",

keywords = "Bondy's theorem; linear algebra",

author = "Andreas Winter",

year = "2000",

month = jan,

doi = "10.1006/jcta.1999.3013",

language = "English",

volume = "89",

pages = "145--147",

journal = "Journal of Combinatorial Theory, Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Another Algebraic Proof of Bondy's Theorem on Induced Subsets

AU - Winter, Andreas

PY - 2000/1

Y1 - 2000/1

N2 - Bondy proved in 1972 that, given a family of n distinct substes of a set X of n elements, one can delete an element of X such that the truncated sets remain distinct. We give a linear algebraic proof of this result and generalize it to codes of minimal distance d.

AB - Bondy proved in 1972 that, given a family of n distinct substes of a set X of n elements, one can delete an element of X such that the truncated sets remain distinct. We give a linear algebraic proof of this result and generalize it to codes of minimal distance d.

KW - Bondy's theorem; linear algebra

UR - http://www.scopus.com/inward/record.url?scp=0041993722&partnerID=8YFLogxK

U2 - 10.1006/jcta.1999.3013

DO - 10.1006/jcta.1999.3013

M3 - Article

AN - SCOPUS:0041993722

SN - 0097-3165

VL - 89

SP - 145

EP - 147

JO - Journal of Combinatorial Theory, Series A

JF - Journal of Combinatorial Theory, Series A

IS - 1

ER -

Another Algebraic Proof of Bondy's Theorem on Induced Subsets

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this