Hypergraphs do not jump

From MaRDI portal
Revision as of 02:30, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (67)

Maximum cliques of hypergraphs and polynomial optimizationOn Frankl and Füredi's conjecture for 3-uniform hypergraphsConnection between the clique number and the Lagrangian of 3-uniform hypergraphsInequalities in probability theory and turán-type problems for graphs with colored verticesA Motzkin-Straus type result for 3-uniform hypergraphsOn the jumping constant conjecture for multigraphsA note on a conjecture of bene Watts-Norin-Yepremyan for LagrangianA note on non-jumping numbers for \(r\)-uniform hypergraphsOn substructure densities of hypergraphsSome results on Lagrangians of hypergraphsOn the number of halving planesOn graph-Lagrangians and clique numbers of 3-uniform hypergraphsCo-degree density of hypergraphsAn Irrational Lagrangian Density of a Single HypergraphSome Ramsey-Turán type results for hypergraphsA note on the jumping constant conjecture of ErdősUnnamed ItemLagrangian densities of some sparse hypergraphs and Turán numbers of their extensionsMaximisers of the hypergraph Lagrangian outside the principal rangeThe Hessian matrix of Lagrange functionNon-jumping numbers for 4-uniform hypergraphsUsing Lagrangians of hypergraphs to find non-jumping numbers. II.On Motzkin-Straus type results for non-uniform hypergraphsThe inducibility of complete bipartite graphsA hypergraph Turán theorem via Lagrangians of intersecting familiesThe maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertexThe maximal length of a gap between \(r\)-graph Turán densitiesNote on upper density of quasi-random hypergraphsHypergraph Turán densities can have arbitrarily large algebraic degreeLagrangian-perfect hypergraphs\(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cyclesLagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhereNon-jumping numbers for 5-uniform hypergraphsLagrangian densities of linear forests and Turán numbers of their extensionsRestricted problems in extremal combinatoricsTwo extremal problems related to ordersGENERATING NON-JUMPING NUMBERS OF HYPERGRAPHSOn possible Turán densitiesOn graph-Lagrangians of hypergraphs containing dense subgraphsOn the largest graph-Lagrangian of 3-graphs with fixed number of edgesEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsA note on the structure of Turán densities of hypergraphsOn Lagrangians of \(r\)-uniform hypergraphsGenerating non-jumping numbers recursivelyDense 3-uniform hypergraphs containing a large cliqueComputing the \(p\)-spectral radii of uniform hypergraphs with applicationsOn jumping densities of hypergraphsThe Chromatic Number of Kneser HypergraphsOn Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Some Motzkin-Straus type results for non-uniform hypergraphsConnection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphsLagrangians of hypergraphs. II: When colex is bestThe Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extensionLagrangian densities of enlargements of matchings in hypergraphsLagrangian densities of short 3-uniform linear paths and Turán numbers of their extensionsHypergraphs Do JumpHypergraph Lagrangians. I: The Frankl-Füredi conjecture is falseA generalization of the Motzkin-Straus theorem to hypergraphsOn non-strong jumping numbers and density structures of hypergraphsA jump to the Bell number for hereditary graph propertiesAn irrational Turán density via hypergraph Lagrangian densitiesNon-jumping Turán densities of hypergraphsA hypergraph extension of Turán's theoremA unified approach to hypergraph stabilityExtremal problems whose solutions are the blowups of the small Witt- designsAsymptotic solution for a new class of forbidden r-graphsOn the algebraic and topological structure of the set of Turán densities




Cites Work




This page was built for publication: Hypergraphs do not jump