|
This article is cited in 2 scientific papers (total in 2 papers)
On Turán's $(3,4)$-Problem with Forbidden Subgraphs
A. A. Razborovab a Steklov Mathematical Institute of the Russian Academy of Sciences
b University of Chicago, USA
Abstract:
We identify three $3$-graphs on five vertices that are missing in all known extremal configurations for Turán's $(3,4)$-problem and prove Turán's conjecture for $3$-graphs that are additionally known not to contain any induced copies of these $3$-graphs. Our argument is based on an (apparently) new technique of “indirect interpretation” that allows us to retrieve additional structure from hypothetical counterexamples to Turán's conjecture, but in rather loose and limited sense. We also include two miscellaneous calculations in flag algebras that prove similar results about some other additional forbidden subgraphs.
Keywords:
Turán's $(3,4)$-problem, $3$-graph, hypergraph, forbidden subgraph.
Received: 13.12.2012 Revised: 23.03.2013
Citation:
A. A. Razborov, “On Turán's $(3,4)$-Problem with Forbidden Subgraphs”, Mat. Zametki, 95:2 (2014), 271–281; Math. Notes, 95:2 (2014), 247–254
Linking options:
https://www.mathnet.ru/eng/mzm10187https://doi.org/10.4213/mzm10187 https://www.mathnet.ru/eng/mzm/v95/i2/p271
|
Statistics & downloads: |
Abstract page: | 630 | Full-text PDF : | 184 | References: | 65 | First page: | 39 |
|