✦ LIBER ✦

Projectivity and independent sets in powers of graphs

✍ Scribed by Benoit Larose; Claude Tardif

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 95 KB
Volume: 40
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.10041

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We investigate the relationship between projectivity and the structure of maximal independent sets in powers of circular graphs, Kneser graphs and truncated simplices. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 162–171, 2002

📜 SIMILAR VOLUMES

Independent sets in tensor graph powers

✍ Alon, Noga (author);Lubetzky, Eyal (author) 📂 Article 📅 2006 🏛 Wiley-Liss Inc. 🌐 English ⚖ 154 KB

## Abstract The tensor product of two graphs, __G__ and __H__, has a vertex set __V__(__G__) × __V__(__H__) and an edge between (__u__,__v__) and (__u__′,__v__′) iff both __u__ __u__′ ∈ __E__(__G__) and __v__ __v__′ ∈ __E__(__H__). Let __A__(__G__) denote the limit of the independence ratios of ten

Independent sets in tensor graph powers

✍ Alon, Noga (author);Lubetzky, Eyal (author) 📂 Article 📅 2006 🏛 Wiley-Liss Inc. 🌐 English ⚖ 154 KB

Independent sets in tensor graph powers

✍ Alon, Noga (author);Lubetzky, Eyal (author) 📂 Article 📅 2006 🏛 Wiley-Liss Inc. 🌐 English ⚖ 154 KB

Independent sets in tensor graph powers

✍ Alon, Noga (author);Lubetzky, Eyal (author) 📂 Article 📅 2006 🏛 Wiley-Liss Inc. 🌐 English ⚖ 154 KB

Independent sets of maximal size in tens

Independent sets of maximal size in tensor powers of vertex-transitive graphs

✍ Cheng Yeaw Ku; Benjamin B. McMillan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 2 views

## Abstract Let __G__ be a connected, nonbipartite vertex‐transitive graph. We prove that if the only independent sets of maximal cardinality in the tensor product __G__ × __G__ are the preimages of the independent sets of maximal cardinality in __G__ under projections, then the same holds for all

Triangles and Neighbourhoods of Independ

Triangles and Neighbourhoods of Independent Sets in Graphs

✍ Andrew M. Robertshaw; Douglas R. Woodall 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 124 KB

It is proved that a graph of order n contains a triangle if |N(X )| > 1 3 (n+|X |) for every independent set X of vertices. This bound is sharp.