scientific article

From MaRDI portal
Publication:3089368

zbMath1244.05159MaRDI QIDQ3089368

Peter Keevash

Publication date: 24 August 2011


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Maximum cliques of hypergraphs and polynomial optimizationPerfect packings in quasirandom hypergraphs. I.Connection between the clique number and the Lagrangian of 3-uniform hypergraphsSpectral extremal graphs for intersecting cliquesAsymmetric list sizes in bipartite graphsEdge-colorings avoiding a fixed matching with a prescribed color patternThe Turán number of disjoint copies of pathsSymmetry in Turán sums of squares polynomials from flag algebrasThe spectral radius of graphs with no intersecting odd cyclesMulticolor Turán numbersA rainbow Erdős-Rothschild problemEmbedding tetrahedra into quasirandom hypergraphsOn graph-Lagrangians and clique numbers of 3-uniform hypergraphsEdge-minimum saturated \(k\)-planar drawingsImproved bounds on the Hadwiger-Debrunner numbersExtremal Problems on the Hypercube and the Codegree Turán Density of Complete $r$-GraphsSome extremal results on hypergraph Turán problemsTurán number of generalized trianglesCodegree Turán Density of Complete $r$-Uniform HypergraphsTournaments, 4-uniform hypergraphs, and an exact extremal resultThe \(\varepsilon\)-\(t\)-net problemMaximisers of the hypergraph Lagrangian outside the principal rangeFinding a minimal spanning hypertree of a weighted hypergraphThe Hessian matrix of Lagrange functionThe Turán polytopeThe Codegree Threshold for 3-Graphs with Independent NeighborhoodsA hypergraph Turán theorem via Lagrangians of intersecting familiesTwo-regular subgraphs of odd-uniform hypergraphsExtremal \(H\)-free planar graphsErdős-Hajnal conjecture for graphs with bounded VC-dimensionThe maximal length of a gap between \(r\)-graph Turán densitiesThe formula for Turán number of spanning linear forestsOn the codegree density of complete 3-graphs and related problemsExact solution of the hypergraph Turán problem for \(k\)-uniform linear pathsExtremal problems in uniformly dense hypergraphsTurán numbers of extensionsTurán, involution and shiftingStability of extremal hypergraphs with applications to an edge-coloring problemThe codegree threshold of \(K_4^-\)Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhereOn a conjecture of spectral extremal problemsThe maximum spectral radius of graphs without spanning linear forestsLinearity of saturation for Berge hypergraphsNew bounds for a hypergraph bipartite Turán problemTurán problems for edge-ordered graphsTwo extremal problems related to ordersIndependent Sets in Hypergraphs and Ramsey Properties of Graphs and the IntegersNew lower bounds for the Turán density of \(PG_m(q)\)Stability theorems for some Kruskal-Katona type resultsOn the co-degree threshold for the Fano planeExtremal hypercuts and shadows of simplicial complexesEdges not in any monochromatic copy of a fixed graphThe Turán number for spanning linear forestsOn possible Turán densitiesEdge-colorings of uniform hypergraphs avoiding monochromatic matchingsMinimum number of affine simplices of given dimensionA linear hypergraph extension of the bipartite Turán problemEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsOn Turán numbers of the complete 4-graphsThe junta method for hypergraphs and the Erdős-Chvátal simplex conjectureDense 3-uniform hypergraphs containing a large cliqueThe spectral radius of graphs with no odd wheelsLinear Turán numbers of acyclic triple systemsUnavoidable hypergraphsComputing the \(p\)-spectral radii of uniform hypergraphs with applicationsExtremal numbers for directed hypergraphs with two edgesSubgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are largeA note on generalized Lagrangians of non-uniform hypergraphsAnalytic methods for uniform hypergraphsThe feasible region of hypergraphsConnection between polynomial optimization and maximum cliques of non-uniform hypergraphsDecomposing uniform hypergraphs into uniform hypertrees and single edgesOn Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Linear trees in uniform hypergraphsNew short proofs to some stability theoremsOn the Maximum Quartet Distance between Phylogenetic TreesLagrangians of hypergraphs. II: When colex is bestThe Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extensionInvitation to intersection problems for finite setsA problem of Erdős on the minimum number of \(k\)-cliquesA universal exponent for homeomorphsRainbow factors in hypergraphsSpectral extremal results for hypergraphsDegenerate Turán densities of sparse hypergraphsHypergraph Lagrangians. I: The Frankl-Füredi conjecture is falseCodegree Thresholds for Covering 3-Uniform HypergraphsAsymptotics for the Turán number of Berge-\(K_{2,t}\)Supersaturation of even linear cycles in linear hypergraphs\(d\)-cluster-free sets with a given matching numberExtremal Theta-free planar graphsExact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-coveringTurán problems for vertex-disjoint cliques in multi-partite hypergraphsPlanar Turán numbers of short pathsNon-jumping Turán densities of hypergraphsImproved bounds on a generalization of Tuza's conjectureA hypergraph Turán problem with no stabilityOn Turán's \((3,4)\)-problem with forbidden subgraphsA unified approach to hypergraph stabilityTurán numbers and batch codesOn the algebraic and topological structure of the set of Turán densitiesUniversal and unavoidable graphsAn Irrational Lagrangian Density of a Single HypergraphSpectral Radius on Linear $r$-Graphs without Expanded $K_{r+1}$Simplicial homeomorphs and trace-bounded hypergraphsHypergraph Turán densities can have arbitrarily large algebraic degreeOn supersaturation and stability for generalized Turán problemsTurán and Ramsey numbers for 3‐uniform minimal paths of length 4Turán numbers for disjoint pathsUniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graphMulticolor list Ramsey numbers grow exponentiallyLagrangian-perfect hypergraphsOn Turán numbers for disconnected hypergraphsUniform Turán density of cyclesA 2-stable family of triple systemsSolving Turán's tetrahedron problem for the ℓ2$\ell _2$‐normExtremal problems in hypergraph colouringsMany Cliques in Bounded-Degree HypergraphsOn the Turán density of uniform hypergraphsDirac-type conditions for spanning bounded-degree hypertreesSpectral extremal problem on disjoint color-critical graphsRestricted problems in extremal combinatoricsOn the limit of the positive \(\ell\)-degree Turán problemUnavoidable order-size pairs in hypergraphs -- positive forcing densityOn the Chromatic Thresholds of HypergraphsA Bound on the Number of Edges in Graphs Without an Even CycleStability and Turán Numbers of a Class of Hypergraphs via Lagrangians$t$-Wise Berge and $t$-Heavy HypergraphsSemantic limits of dense combinatorial objectsRelative Turán Problems for Uniform HypergraphsHypergraph Removal Lemmas via Robust Sharp Threshold TheoremsTurán numbers of theta graphsTriangle-degrees in graphs and tetrahedron coverings in 3-graphsA geometric theory for hypergraph matchingOn the Codegree Density of $PG_m(q)$Finding the shortest path for a HypergraphA hypergraph Turán theorem via Lagrangians of intersecting familiesA Ramsey variant of the Brown–Erdős–Sós conjecture