Exact computation of the hypergraph Turán function for expanded complete 2-graphs

From MaRDI portal
Publication:1945994

DOI10.1016/j.jctb.2012.09.005zbMath1261.05073arXivmath/0510227OpenAlexW1998787536MaRDI QIDQ1945994

Oleg Pikhurko

Publication date: 17 April 2013

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0510227




Related Items (33)

Turán numbers for hypergraph star forestsAn intersection theorem for four setsTurán problems and shadows. II: TreesTurán numbers of complete 3-uniform Berge-hypergraphsExact solution of the hypergraph Turán problem for \(k\)-uniform linear pathsUniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graphTurán numbers of extensionsStability of extremal hypergraphs with applications to an edge-coloring problemLinearity of saturation for Berge hypergraphsInduced Turán problems and traces of hypergraphsOn non-degenerate Berge-Turán problemsOn the Chromatic Thresholds of HypergraphsStability and Turán Numbers of a Class of Hypergraphs via LagrangiansStability theorems for some Kruskal-Katona type resultsOn the Ramsey-Turán numbers of graphs and hypergraphs$t$-Wise Berge and $t$-Heavy HypergraphsThe Turán Number of Berge K_4 in Triple SystemsGeneral lemmas for Berge-Turán hypergraph problemsForbidding complete hypergraphs as tracesThe feasible region of hypergraphsStability results for random discrete structuresTurán numbers for Berge-hypergraphs and related extremal problemsRamsey numbers of Berge-hypergraphs and related structuresLinear trees in uniform hypergraphsRainbow Erdös--Rothschild Problem for the Fano PlaneThe Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extensionHypergraph based Berge hypergraphsStability Results for Two Classes of HypergraphsStructure and stability of triangle-free set systemsTurán Problems and Shadows III: Expansions of GraphsA hypergraph Turán problem with no stabilityA unified approach to hypergraph stabilityA linear hypergraph extension of Turán's theorem




This page was built for publication: Exact computation of the hypergraph Turán function for expanded complete 2-graphs