𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On some extremal problems on r-graphs

✍ Scribed by P. Erdös

Publisher
Elsevier Science
Year
1971
Tongue
English
Weight
499 KB
Volume
1
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Abslract. Denote by @)(n; k) an ~-graph of n vcrtieca and k r-tuples. Turin's classical problem states: Detomline the smailcst integer f(n;r, I) so that cvcry G%; f(n; r, I)) contains a K@)(I). Tur&n determined f (n; r, I) for r = 2, but nothing is known for r > ?. Put lim,,f(n; t, O/(y) = c,,~ The values of c, 2 are not known for I > 2. t prove that to &cry e > 0 and intcgcr t there is an no = na(t, e) so that every &'tn ; [ (cp t + c) ()!I} ) has It vertices x!',

.

1 <, i 5 t, 1 <: j <, I, so that all the r-tuples c. cil) 141 ) . ..I.

📜 SIMILAR VOLUMES

An extremal problem on Kr-free graphs
An extremal problem on Kr-free graphs
✍ Peter Frankl; János Pach 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 2 views

Let r, t 2 2 be integers and c a constant, 0 < c 5 ( r -2 ) / ( r -1). Suppose that G is a &-free graph on n vertices in which any t distinct vertices have at most cn common neighbors. Here an asymptotically best bound is obtained for the maximal number of edges in such graphs. This solves a problem

r-domination problems on homogeneously o
r-domination problems on homogeneously orderable graphs
✍ Dragan, Feodor F.; Nicolai, Falk 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 2 views

In this paper, we consider r-dominating cliques in homogeneously orderable graphs (a common generalization of dually chordal and distance-hereditary graphs) and their relation to strict r-packing sets. We prove that a homogeneously orderable graph G possesses an r-dominating clique if and only if fo

On clique-extremal (p,q)-graphs
On clique-extremal (p,q)-graphs
✍ F. Harary; A. Lempel 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

## Abstract A clique of a graph is a maximal complete subgraph. A (p,q)‐graph has p points and q lines. A clique‐extremal (p,q)‐graph has either the maximum or the minimum number of cliques among all (p,q)‐graphs. Moon and Moser have determined constructively the maximum number of cliques in a p‐po