✦ LIBER ✦

Intersection theory for graphs

✍ Scribed by Tom Brylawski

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 657 KB
Volume: 30
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(81)90068-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal Graphs for Intersecting Triangl

Extremal Graphs for Intersecting Triangles

✍ P. Erdos; Z. Furedi; R.J. Gould; D.S. Gunderson 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 400 KB

It is known that for a graph on \(n\) vertices \(\left\lfloor n^{2} / 4\right\rfloor+1\) edges is sufficient for the existence of many triangles. In this paper, we determine the minimum number of edges sufficient for the existence of \(k\) triangles intersecting in exactly one common vertex. C 1995

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

On grid intersection graphs

✍ I.Ben-Arroyo Hartman; Ilan Newman; Ran Ziv 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 759 KB

Hartman I.B.-A., I. Newman and R. Ziv, On grid intersection graphs, Discrete Mathematics 87 (1991) 41-52. A bipartite graph G = (X, Y; E) has a grid representation if X and Y correspond to sets of horizontal and vertical segments in the plane, respectively, such that (xi, y,) E E if and only if segm

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

Set intersection representations for alm

Set intersection representations for almost all graphs

✍ Eaton, Nancy; Grable, David A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 581 KB

Two variations of set intersection representation are investigated and upper and lower bounds on the minimum number of labels with which a graph may be represented are found that hold for almost all graphs. Specifically, if &(G) is defined to be the minimum number of labels with which G may be repre

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,