𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On c+-chromatic graphs with small bounded subgraphs

✍ Scribed by L. Soukup

Book ID
105407594
Publisher
Springer Netherlands
Year
1990
Tongue
English
Weight
364 KB
Volume
21
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extremal graphs with bounded densities o
Extremal graphs with bounded densities of small subgraphs
✍ Griggs, Jerrold R.; Simonovits, MiklοΏ½os; Thomas, George Rubin πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 373 KB πŸ‘ 1 views

Let Ex(n, k, Β΅) denote the maximum number of edges of an n-vertex graph in which every subgraph of k vertices has at most Β΅ edges. Here we summarize some known results of the problem of determining Ex(n, k, Β΅), give simple proofs, and find some new estimates and extremal graphs. Besides proving new

On complete subgraphs of r-chromatic gra
On complete subgraphs of r-chromatic graphs
✍ B. BollobΓ‘s; P. ErdΓΆs; E. SzemerΓ©di πŸ“‚ Article πŸ“… 1975 πŸ› Elsevier Science 🌐 English βš– 518 KB
Almost-Spanning Subgraphs with Bounded D
Almost-Spanning Subgraphs with Bounded Degree in Dense Graphs
✍ Yoshiyasu Ishigami πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 330 KB

We present two extensions of a theorem by Alon and Yuster (1992, Graphs Comb., 8, 95-102) that give degree conditions guaranteeing an almost-spanning subgraph isomorphic to a given graph. The first extension gives a sharp degree condition when the desired subgraph consists of small connected compone