Hypergraphs Do Jump
From MaRDI portal
Publication:3081326
DOI10.1017/S0963548310000222zbMath1213.05184arXiv1004.3733OpenAlexW2168244850MaRDI QIDQ3081326
Publication date: 7 March 2011
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.3733
Related Items (45)
A problem of Erdős and Sós on 3-graphs ⋮ Finitely forcible graph limits are universal ⋮ A note on non-jumping numbers for \(r\)-uniform hypergraphs ⋮ Non-Three-Colourable Common Graphs Exist ⋮ Small cores in 3-uniform hypergraphs ⋮ Rainbow triangles in three-colored graphs ⋮ Tournaments, 4-uniform hypergraphs, and an exact extremal result ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ The maximal length of a gap between \(r\)-graph Turán densities ⋮ Hypergraph Turán densities can have arbitrarily large algebraic degree ⋮ Extremal problems in uniformly dense hypergraphs ⋮ Lagrangian-perfect hypergraphs ⋮ Non-jumping numbers for 5-uniform hypergraphs ⋮ Uniform Turán density of cycles ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Restricted problems in extremal combinatorics ⋮ Minimum Number of Monotone Subsequences of Length 4 in Permutations ⋮ Exact Minimum Codegree Threshold for K−4-Factors ⋮ Finitely forcible graphons with an almost arbitrary structure ⋮ A new lower bound based on Gromov's method of selecting heavily covered points ⋮ The minimum size of 3-graphs without a 4-set spanning no or exactly three edges ⋮ GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS ⋮ On possible Turán densities ⋮ Finitely forcible graphons and permutons ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Minimum Number ofk-Cliques in Graphs with Bounded Independence Number ⋮ Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs ⋮ Semidefinite Programming and Ramsey Numbers ⋮ On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament ⋮ Two Questions of Erdős on Hypergraphs above the Turán Threshold ⋮ Counting flags in triangle-free digraphs ⋮ A New Bound for the 2/3 Conjecture ⋮ On the maximum number of five-cycles in a triangle-free graph ⋮ Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube ⋮ On the Maximum Quartet Distance between Phylogenetic Trees ⋮ Maximizing five-cycles in \(K_r\)-free graphs ⋮ A problem of Erdős on the minimum number of \(k\)-cliques ⋮ Decomposing Graphs into Edges and Triangles ⋮ Minimum number of edges that occur in odd cycles ⋮ Closing in on Hill's Conjecture ⋮ Weak regularity and finitely forcible graph limits ⋮ Compactness and finite forcibility of graphons ⋮ Inducibility of directed paths ⋮ Non-jumping Turán densities of hypergraphs ⋮ On the algebraic and topological structure of the set of Turán densities
Uses Software
Cites Work
This page was built for publication: Hypergraphs Do Jump
