Hypergraphs do not jump

From MaRDI portal
Publication:1114711

DOI10.1007/BF02579215zbMath0663.05047OpenAlexW1978688508MaRDI QIDQ1114711

Vojtěch Rödl, Peter Frankl

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579215



Related Items

Maximum cliques of hypergraphs and polynomial optimization, On Frankl and Füredi's conjecture for 3-uniform hypergraphs, Connection between the clique number and the Lagrangian of 3-uniform hypergraphs, Inequalities in probability theory and turán-type problems for graphs with colored vertices, A Motzkin-Straus type result for 3-uniform hypergraphs, On the jumping constant conjecture for multigraphs, A note on a conjecture of bene Watts-Norin-Yepremyan for Lagrangian, A note on non-jumping numbers for \(r\)-uniform hypergraphs, On substructure densities of hypergraphs, Some results on Lagrangians of hypergraphs, On the number of halving planes, On graph-Lagrangians and clique numbers of 3-uniform hypergraphs, Co-degree density of hypergraphs, An Irrational Lagrangian Density of a Single Hypergraph, Some Ramsey-Turán type results for hypergraphs, A note on the jumping constant conjecture of Erdős, Unnamed Item, Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions, Maximisers of the hypergraph Lagrangian outside the principal range, The Hessian matrix of Lagrange function, Non-jumping numbers for 4-uniform hypergraphs, Using Lagrangians of hypergraphs to find non-jumping numbers. II., On Motzkin-Straus type results for non-uniform hypergraphs, The inducibility of complete bipartite graphs, A hypergraph Turán theorem via Lagrangians of intersecting families, The maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertex, The maximal length of a gap between \(r\)-graph Turán densities, Note on upper density of quasi-random hypergraphs, Hypergraph Turán densities can have arbitrarily large algebraic degree, Lagrangian-perfect hypergraphs, \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles, Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere, Non-jumping numbers for 5-uniform hypergraphs, Lagrangian densities of linear forests and Turán numbers of their extensions, Restricted problems in extremal combinatorics, Two extremal problems related to orders, GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS, On possible Turán densities, On graph-Lagrangians of hypergraphs containing dense subgraphs, On the largest graph-Lagrangian of 3-graphs with fixed number of edges, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A note on the structure of Turán densities of hypergraphs, On Lagrangians of \(r\)-uniform hypergraphs, Generating non-jumping numbers recursively, Dense 3-uniform hypergraphs containing a large clique, Computing the \(p\)-spectral radii of uniform hypergraphs with applications, On jumping densities of hypergraphs, The Chromatic Number of Kneser Hypergraphs, On Hamiltonian Berge cycles in [3-uniform hypergraphs], Some Motzkin-Straus type results for non-uniform hypergraphs, Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs, Lagrangians of hypergraphs. II: When colex is best, The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension, Lagrangian densities of enlargements of matchings in hypergraphs, Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions, Hypergraphs Do Jump, Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false, A generalization of the Motzkin-Straus theorem to hypergraphs, On non-strong jumping numbers and density structures of hypergraphs, A jump to the Bell number for hereditary graph properties, An irrational Turán density via hypergraph Lagrangian densities, Non-jumping Turán densities of hypergraphs, A hypergraph extension of Turán's theorem, A unified approach to hypergraph stability, Extremal problems whose solutions are the blowups of the small Witt- designs, Asymptotic solution for a new class of forbidden r-graphs, On the algebraic and topological structure of the set of Turán densities



Cites Work