scientific article
From MaRDI portal
Publication:3089368
zbMath1244.05159MaRDI QIDQ3089368
Publication date: 24 August 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Maximum cliques of hypergraphs and polynomial optimization ⋮ Perfect packings in quasirandom hypergraphs. I. ⋮ Connection between the clique number and the Lagrangian of 3-uniform hypergraphs ⋮ Spectral extremal graphs for intersecting cliques ⋮ Asymmetric list sizes in bipartite graphs ⋮ Edge-colorings avoiding a fixed matching with a prescribed color pattern ⋮ The Turán number of disjoint copies of paths ⋮ Symmetry in Turán sums of squares polynomials from flag algebras ⋮ The spectral radius of graphs with no intersecting odd cycles ⋮ Multicolor Turán numbers ⋮ A rainbow Erdős-Rothschild problem ⋮ Embedding tetrahedra into quasirandom hypergraphs ⋮ On graph-Lagrangians and clique numbers of 3-uniform hypergraphs ⋮ Edge-minimum saturated \(k\)-planar drawings ⋮ Improved bounds on the Hadwiger-Debrunner numbers ⋮ Extremal Problems on the Hypercube and the Codegree Turán Density of Complete $r$-Graphs ⋮ Some extremal results on hypergraph Turán problems ⋮ Turán number of generalized triangles ⋮ Codegree Turán Density of Complete $r$-Uniform Hypergraphs ⋮ Tournaments, 4-uniform hypergraphs, and an exact extremal result ⋮ The \(\varepsilon\)-\(t\)-net problem ⋮ Maximisers of the hypergraph Lagrangian outside the principal range ⋮ Finding a minimal spanning hypertree of a weighted hypergraph ⋮ The Hessian matrix of Lagrange function ⋮ The Turán polytope ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ A hypergraph Turán theorem via Lagrangians of intersecting families ⋮ Two-regular subgraphs of odd-uniform hypergraphs ⋮ Extremal \(H\)-free planar graphs ⋮ Erdős-Hajnal conjecture for graphs with bounded VC-dimension ⋮ The maximal length of a gap between \(r\)-graph Turán densities ⋮ The formula for Turán number of spanning linear forests ⋮ On the codegree density of complete 3-graphs and related problems ⋮ Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ Extremal problems in uniformly dense hypergraphs ⋮ Turán numbers of extensions ⋮ Turán, involution and shifting ⋮ Stability of extremal hypergraphs with applications to an edge-coloring problem ⋮ The codegree threshold of \(K_4^-\) ⋮ Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere ⋮ On a conjecture of spectral extremal problems ⋮ The maximum spectral radius of graphs without spanning linear forests ⋮ Linearity of saturation for Berge hypergraphs ⋮ New bounds for a hypergraph bipartite Turán problem ⋮ Turán problems for edge-ordered graphs ⋮ Two extremal problems related to orders ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ New lower bounds for the Turán density of \(PG_m(q)\) ⋮ Stability theorems for some Kruskal-Katona type results ⋮ On the co-degree threshold for the Fano plane ⋮ Extremal hypercuts and shadows of simplicial complexes ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ The Turán number for spanning linear forests ⋮ On possible Turán densities ⋮ Edge-colorings of uniform hypergraphs avoiding monochromatic matchings ⋮ Minimum number of affine simplices of given dimension ⋮ A linear hypergraph extension of the bipartite Turán problem ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On Turán numbers of the complete 4-graphs ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Dense 3-uniform hypergraphs containing a large clique ⋮ The spectral radius of graphs with no odd wheels ⋮ Linear Turán numbers of acyclic triple systems ⋮ Unavoidable hypergraphs ⋮ Computing the \(p\)-spectral radii of uniform hypergraphs with applications ⋮ Extremal numbers for directed hypergraphs with two edges ⋮ Subgraphs with large minimum \(\ell\)-degree in hypergraphs where almost all \(\ell\)-degrees are large ⋮ A note on generalized Lagrangians of non-uniform hypergraphs ⋮ Analytic methods for uniform hypergraphs ⋮ The feasible region of hypergraphs ⋮ Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs ⋮ Decomposing uniform hypergraphs into uniform hypertrees and single edges ⋮ On Hamiltonian Berge cycles in [3-uniform hypergraphs] ⋮ Linear trees in uniform hypergraphs ⋮ New short proofs to some stability theorems ⋮ On the Maximum Quartet Distance between Phylogenetic Trees ⋮ Lagrangians of hypergraphs. II: When colex is best ⋮ The Lagrangian density of \(\{123, 234, 456\}\) and the Turán number of its extension ⋮ Invitation to intersection problems for finite sets ⋮ A problem of Erdős on the minimum number of \(k\)-cliques ⋮ A universal exponent for homeomorphs ⋮ Rainbow factors in hypergraphs ⋮ Spectral extremal results for hypergraphs ⋮ Degenerate Turán densities of sparse hypergraphs ⋮ Hypergraph Lagrangians. I: The Frankl-Füredi conjecture is false ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Asymptotics 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 number ⋮ Extremal Theta-free planar graphs ⋮ Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering ⋮ Turán problems for vertex-disjoint cliques in multi-partite hypergraphs ⋮ Planar Turán numbers of short paths ⋮ Non-jumping Turán densities of hypergraphs ⋮ Improved bounds on a generalization of Tuza's conjecture ⋮ A hypergraph Turán problem with no stability ⋮ On Turán's \((3,4)\)-problem with forbidden subgraphs ⋮ A unified approach to hypergraph stability ⋮ Turán numbers and batch codes ⋮ On the algebraic and topological structure of the set of Turán densities
This page was built for publication:
