scientific article; zbMATH DE number 5942358

zbMATH Open1244.05159MaRDI QIDQ3089368FDOQ3089368

Authors: Peter Keevash 

Publication date: 24 August 2011

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1439495
• The Turán problem for hypergraphs on fixed size
• Turán problems on non-uniform hypergraphs
• The Turán density problem for hypergraphs
• Some extremal results on hypergraph Turán problems
• scientific article; zbMATH DE number 3869379
• Turánnical hypergraphs
• Multipartite Turán problem for connected graphs and hypergraphs
• On a hypergraph Turán problem of Frankl
• A hypergraph Turán problem with no stability

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cited In (only showing first 100 items - show all)

• Stability theorems for some Kruskal-Katona type results
• The spectral radius of graphs with no odd wheels
• Unavoidable hypergraphs
• On local Turán problems
• Spectral radius on linear \(r\)-graphs without expanded \(K_{r+1}\)
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Spectral extremal graphs for intersecting cliques
• The maximum spectral radius of graphs without spanning linear forests
• The spectral radius of graphs with no intersecting odd cycles
• The feasible region of hypergraphs
• Dense 3-uniform hypergraphs containing a large clique
• A hypergraph Turán theorem via Lagrangians of intersecting families
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• Multicolor Turán numbers
• A unified approach to hypergraph stability
• Linearity of saturation for Berge hypergraphs
• Extremal numbers for directed hypergraphs with two edges
• Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
• Extremal problems in hypergraph colourings
• The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension
• New bounds for a hypergraph bipartite Turán problem
• The formula for Turán number of spanning linear forests
• \(t\)-wise Berge and \(t\)-heavy hypergraphs
• Turán function and \(H\)-decomposition problem for gem graphs
• Independent sets in hypergraphs and Ramsey properties of graphs and the integers
• New short proofs to some stability theorems
• On supersaturation and stability for generalized Turán problems
• Edge-minimum saturated \(k\)-planar drawings
• Turán numbers and batch codes
• Turán numbers of extensions
• A universal exponent for homeomorphs
• Spectral extremal results for hypergraphs
• The Turán polytope
• Rainbow factors in hypergraphs
• Hypergraph removal lemmas via robust sharp threshold theorems
• The \(\varepsilon\)-\(t\)-net problem
• Maximisers of the hypergraph Lagrangian outside the principal range
• Finding a minimal spanning hypertree of a weighted hypergraph
• High dimensional Hoffman bound and applications in extremal combinatorics
• Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false
• The Turán number of disjoint copies of paths
• Extremal Theta-free planar graphs
• Turán numbers for disjoint paths
• Planar Turán numbers of short paths
• Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph
• Stability of extremal hypergraphs with applications to an edge-coloring problem
• Codegree Turán density of complete \(r\)-uniform hypergraphs
• Many Cliques in Bounded-Degree Hypergraphs
• Linear Turán numbers of acyclic triple systems
• Lagrangians of hypergraphs. II: When colex is best
• Two extremal problems related to orders
• An irrational Lagrangian density of a single hypergraph
• Asymptotics for the Turán number of Berge-\(K_{2,t}\)
• On Turán numbers for disconnected hypergraphs
• A Ramsey variant of the Brown-Erdős-Sós conjecture
• On Hamiltonian Berge cycles in [3]-uniform hypergraphs
• Extremal hypercuts and shadows of simplicial complexes
• Asymmetric list sizes in bipartite graphs
• Tournaments, 4-uniform hypergraphs, and an exact extremal result
• On the Chromatic Thresholds of Hypergraphs
• On the codegree density of complete 3-graphs and related problems
• Improved bounds on a generalization of Tuza's conjecture
• Decomposing uniform hypergraphs into uniform hypertrees and single edges
• Perfect packings in quasirandom hypergraphs. I.
• Connection between the clique number and the Lagrangian of 3-uniform hypergraphs
• Linear trees in uniform hypergraphs
• Turán numbers of theta graphs
• Improved bounds on the Hadwiger-Debrunner numbers
• A geometric theory for hypergraph matching
• Maximum cliques of hypergraphs and polynomial optimization
• On the maximum quartet distance between phylogenetic trees
• On the codegree density of \(\mathrm{PG}_m(q)\)
• Hypergraph Turán numbers of vertex disjoint cycles
• Some extremal results on hypergraph Turán problems
• A linear hypergraph extension of the bipartite Turán problem
• Turán problems on non-uniform hypergraphs
• Rational exponents for hypergraph Turan problems
• Asymptotic solution of the Turán problem for some hypergraphs
• On the algebraic and topological structure of the set of Turán densities
• On possible Turán densities
• The maximal length of a gap between \(r\)-graph Turán densities
• Finding the shortest path for a hypergraph
• Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
• Edges not in any monochromatic copy of a fixed graph
• Turánnical hypergraphs
• A hypergraph extension of Turán's theorem
• Relative Turán problems for uniform hypergraphs
• The codegree threshold for 3-graphs with independent neighborhoods
• Two-regular subgraphs of odd-uniform hypergraphs
• Codegree thresholds for covering 3-uniform hypergraphs
• Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
• Analytic methods for uniform hypergraphs
• Embedding tetrahedra into quasirandom hypergraphs
• On graph-Lagrangians and clique numbers of 3-uniform hypergraphs
• On the co-degree threshold for the Fano plane
• On a conjecture of spectral extremal problems
• Extremal \(H\)-free planar graphs
• A hypergraph Turán theorem via Lagrangians of intersecting families
• Edge-colorings of uniform hypergraphs avoiding monochromatic matchings
• Universal and unavoidable graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3089368)