arXiv Analytics

Sign in

arXiv:1201.3587 [math.CO]AbstractReferencesReviewsResources

Turán densities of hypercubes

Rahil Baber

Published 2012-01-17, updated 2012-11-13Version 2

In this paper we describe a number of extensions to Razborov's semidefinite flag algebra method. We will begin by showing how to apply the method to significantly improve the upper bounds of edge and vertex Tur\'an density type results for hypercubes. We will then introduce an improvement to the method which can be applied in a more general setting, notably to 3-uniform hypergraphs, to get a new upper bound of 0.5615 for $\pi(K_4^3)$. For hypercubes we improve Thomason and Wagner's result on the upper bound of the edge Tur\'an density of a 4-cycle free subcube to 0.60318 and Chung's result on forbidding 6-cycles to 0.36577. We also show that the upper bound of the vertex Tur\'an density of $\mc{Q}_3$ can be improved to 0.76900, and that the vertex Tur\'an density of $\mc{Q}_3$ with one vertex removed is precisely 2/3.

Comments: 18 pages, 4 figures. Additional files: 3 C++ source code files, and 8 data text files for proof verification. Revised to include a new bound for \pi(K_4^3), improved bounds for the hypercube edge Tur\'an density results, and a new extension of Razborov's method
Categories: math.CO
Subjects: 05D05
Related articles: Most relevant | Search more
arXiv:2401.16289 [math.CO] (Published 2024-01-29, updated 2024-02-06)
Turán Densities for Daisies and Hypercubes
arXiv:0906.0195 [math.CO] (Published 2009-06-01, updated 2010-04-28)
New upper bound for the cardinalities of $s$-distance sets on the unit sphere
arXiv:1905.13292 [math.CO] (Published 2019-05-30)
Spanning Trees and Domination in Hypercubes