𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Intersection number and capacities of graphs

✍ Scribed by J. Körner

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
955 KB
Volume
142
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

For an arbitrary graph G we determine the asymptotics of the intersection number (edgeclique covering number) of the categorical (or weak) product of G and the complete graph K,, asymptotically in n. The result follows from a more general theorem on graph capacities which generalizes an earlier result with Gargano and Vaccaro on Sperner capacities.

📜 SIMILAR VOLUMES

On antichain intersection numbers, total
On antichain intersection numbers, total clique covers and regular graphs
✍ Morimasa Tsuchiya 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 742 KB

In this paper, we consider total clique covers and intersection numbers on multifamilies. We determine the antichain intersection numbers of graphs in terms of total clique covers. From this result and some properties of intersection graphs on multifamilies, we determine the antichain intersection n

Intersection properties of graphs
Intersection properties of graphs
✍ Terry A. McKee 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 550 KB

McKee, T.A., Intersection properties of graphs, Discrete Mathematics 89 (1991) 253-260. For each graph-theoretic property, we define a corresponding 'intersection property', motivated by the natural relationship of paths with interval graphs, and of trees with chordal graphs. We then develop a simp

Intersection Graphs of Segments
Intersection Graphs of Segments
✍ J. Kratochvil; J. Matousek 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 998 KB

Intersection graphs of segments (the class SEG) and of other simple geometric objects in the plane are considered. The results fall into two main areas: how difficult is the membership problem for a given class and how large are the pictures needed to draw the representations. Among others, we prove

Intersections of graphs
Intersections of graphs
✍ Béla Bollobás; Alex Scott 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB

Let G and H be two graphs of order n. If we place copies of G and H on a common vertex set, how much or little can they be made to overlap? The aim of this article is to provide some answers to this question, and to pose a number of related problems. Along the way, we solve a conjecture of Erd" os,