Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs - MaRDI portal

On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs

From MaRDI portal
Publication:1123216

DOI10.1007/BF01158259zbMath0677.05064MaRDI QIDQ1123216

Alexander Sidorenko

Publication date: 1987

Published in: Mathematical Notes (Search for Journal in Brave)




Related Items (41)

The clique number and the smallest \(Q\)-eigenvalue of graphs2-Cancellative Hypergraphs and CodesMaximum cliques of hypergraphs and polynomial optimizationStability theorems for cancellative hypergraphsBoundedness of optimal matrices in extremal multigraph and digraph problemsInequalities in probability theory and turán-type problems for graphs with colored verticesOn the jumping constant conjecture for multigraphsOn graph-Lagrangians and clique numbers of 3-uniform hypergraphsOn ramsey-tuŕan numbers for 3-graphsAn Irrational Lagrangian Density of a Single HypergraphTurán number of generalized trianglesUnnamed ItemThe Hessian matrix of Lagrange functionThe inducibility of complete bipartite graphsA new generalization of Mantel's theorem to \(k\)-graphsThe maximum Lagrangian of 5-uniform hypergraphs without containing two edges intersecting at a vertexLagrangian-perfect hypergraphs\(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cyclesLagrangian densities of linear forests and Turán numbers of their extensionsAn extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applicationsStability and Turán Numbers of a Class of Hypergraphs via LagrangiansStability theorems for some Kruskal-Katona type resultsHypergraphs with independent neighborhoodsOn possible Turán densitiesEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsDense 3-uniform hypergraphs containing a large cliqueAn exact Turán result for the generalized triangleComputing the \(p\)-spectral radii of uniform hypergraphs with applicationsOn \(k\)-uniform random hypergraphs without generalized fansA note on generalized Lagrangians of non-uniform hypergraphsAnalytic methods for uniform hypergraphs4-books of three pagesSome Motzkin-Straus type results for non-uniform hypergraphsConnection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphsLagrangian densities of enlargements of matchings in hypergraphsLagrangian densities of short 3-uniform linear paths and Turán numbers of their extensionsTurán's theorem implies Stanley's boundAn irrational Turán density via hypergraph Lagrangian densitiesA unified approach to hypergraph stabilityAsymptotic solution for a new class of forbidden r-graphsOn the Turán number of triple systems



Cites Work


This page was built for publication: On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs