𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Forbidden configurations in intersection graphs of r-graphs

✍ Scribed by M.L. Gardner

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
335 KB
Volume
31
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On planar intersection graphs with forbi
On planar intersection graphs with forbidden subgraphs
✍ JΓ‘nos Pach; Micha Sharir πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 154 KB

## Abstract Let ${\cal C}$ be a family of __n__ compact connected sets in the plane, whose intersection graph $G({\cal C})$ has no complete bipartite subgraph with __k__ vertices in each of its classes. Then $G({\cal C})$ has at most __n__ times a polylogarithmic number of edges, where the exponent

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,

Characterizing intersection classes of g
Characterizing intersection classes of graphs
✍ Edward R. Scheinerman πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 571 KB

A graph is an intersection graph if it is possible to assign sets to its vertices so that adjacency corresponds exactly to nonempty intersection. If the sets assigned to vertices must belong to a pre-specified family, the resulting class of all possible intersection graphs is called an intersection