Extremal hypersgraphs and bounds for the Turan density of the 4-uniform K5 Klas Markstr¨om October 14, 2008 Abstract In this paper we find, for n ≤ 16, the maximum number of edges - Arithmetic progression - Document - PDFSEARCH.IO

First Page	Meta Content
	Extremal hypersgraphs and bounds for the Turan density of the 4-uniform K5 Klas Markstr¨om October 14, 2008 Abstract In this paper we find, for n ≤ 16, the maximum number of edges Add to Reading List Document Date: 2013-12-11 09:07:22 Open Document File Size: 89,11 KB Share Result on Facebook City Winnipeg / New York / Springer-Verlag / Mineola / / Company Dover Publications Inc. / D. L. Kreher S. P. / Let us / / IndustryTerm brute force combinatorial search / large scale computer search / web archive / particular solution / glpk-package http / OperatingSystem GNU / / Organization Chalmers Centre for Computational Science and Engineering / / Person Gyula Katona / Klas Markstr¨om / John Stufken / Brendan D. McKay / Alexander Sidorenko / Guy R. Giraud / J. A. Sloane / Andrew Makhorin / / ProvinceOrState New York / / Technology html / / URL http / SocialTag Turán graph Graph operations Planar graphs Algebraic graph theory Line graph Graph theory Extremal graph theory Hypergraph

Extremal hypersgraphs and bounds for the Turan density of the 4-uniform K5 Klas Markstr¨om October 14, 2008 Abstract In this paper we find, for n ≤ 16, the maximum number of edgesAdd to Reading List