Extremal graphs without three-cycles or four-cycles

We derive bounds for f(v), the maximum number of edges in a graph on v vertices that contains neither three‐cycles nor four‐cycles. Also, we give the exact value of f(v) for all v up to 24 and constructive lower bounds for all v up to 200. © 1993 John Wiley & Sons, Inc.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of graph theory 1993-11, Vol.17 (5), p.633-645
Hauptverfasser:	Garnick, David K., Kwong, Y. H. Harris, Lazebnik, Felix
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Combinatorics. Ordered structures Exact sciences and technology Graph theory Mathematics Sciences and techniques of general use
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We derive bounds for f(v), the maximum number of edges in a graph on v vertices that contains neither three‐cycles nor four‐cycles. Also, we give the exact value of f(v) for all v up to 24 and constructive lower bounds for all v up to 200. © 1993 John Wiley & Sons, Inc.
ISSN:	0364-9024 1097-0118
DOI:	10.1002/jgt.3190170511