✦ LIBER ✦

Extremal Graphs for Intersecting Triangles

✍ Scribed by P. Erdos; Z. Furedi; R.J. Gould; D.S. Gunderson

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 400 KB
Volume: 64
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1995.1026

No coin nor oath required. For personal study only.

✦ Synopsis

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 Academic Press, Inc.

📜 SIMILAR VOLUMES

Extremal graphs for homomorphisms

✍ Jonathan Cutler; A. J. Radcliffe 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

The study of graph homomorphisms has a long and distinguished history, with applications in many areas of graph theory. There has been recent interest in counting homomorphisms, and in particular on the question of finding upper bounds for the number of homomorphisms from a graph G into a fixed imag

Extremal bipartite subgraphs of cubic tr

Extremal bipartite subgraphs of cubic triangle-free graphs

✍ Glenn Hopkins; William Staton 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB

## Abstract A cubic triangle‐free graph has a bipartite subgraph with at least 4/5 of the original edges. Examples show that this is a best possible result.

A fast triangle to triangle intersection

A fast triangle to triangle intersection test for collision detection

✍ Oren Tropp; Ayellet Tal; Ilan Shimshoni 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB

Lollipop graphs are extremal for commute

Lollipop graphs are extremal for commute times

✍ Johan Jonasson 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

Consider a simple random walk on a connected graph G = V E . Let C u v be the expected time taken for the walk starting at vertex u to reach vertex v and then go back to u again, i.e., the commute time for u and v, and let C G = max u v∈V C u v . Further, let n m be the family of connected graphs on

An extremal bandwidth problem for bipart

An extremal bandwidth problem for bipartite graphs

✍ Robert C. Brigham; Julie R. Carrington; Ronald D. Dutton; Joseph Fiedler; Richar 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 2 views

An extremal problem for H-linked graphs

✍ Alexandr Kostochka; Gexin Yu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 1 views

## Abstract We introduce the notion of __H__‐linked graphs, where __H__ is a fixed multigraph with vertices __w__~1~,…,__w__~m~. A graph __G__ is __H__‐__linked__ if for every choice of vertices υ~1~,…, υ~m~ in __G__, there exists a subdivision of __H__ in __G__ such that υ~i~ is the branch vertex