𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds on the number of triangles in a graph

✍ Scribed by David C. Fisher

Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
294 KB
Volume
13
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

New bounds on the edge number of a k-map
New bounds on the edge number of a k-map graph
✍ Zhi-Zhong Chen πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 310 KB πŸ‘ 1 views

## Abstract It is known that for every integer __k__ β‰₯ 4, each __k__‐map graph with __n__ vertices has at most __kn__ βˆ’ 2__k__ edges. Previously, it was open whether this bound is tight or not. We show that this bound is tight for __k__ = 4, 5. We also show that this bound is not tight for large en

A topological lower bound for the circul
A topological lower bound for the circular chromatic number of Schrijver graphs
✍ Meunier, FrΓ©dΓ©ric (author) πŸ“‚ Article πŸ“… 2005 πŸ› Wiley-Liss Inc. 🌐 English βš– 66 KB πŸ‘ 1 views

## Abstract In this paper, we prove that the Kneser graphs defined on a ground set of __n__ elements, where __n__ is even, have their circular chromatic numbers equal to their chromatic numbers. Β© 2005 Wiley Periodicals, Inc. J Graph Theory 49: 257–261, 2005