On the Minimal Density of Triangles in Graphs
From MaRDI portal
Publication:3527546
DOI10.1017/S0963548308009085zbMath1170.05036OpenAlexW2011575706MaRDI QIDQ3527546
Publication date: 29 September 2008
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548308009085
Related Items
Paths of length three are \(K_{r+1}\)-Turán-good, Subgraph densities in a surface, Cliques in Graphs With Bounded Minimum Degree, Finitely forcible graph limits are universal, Minimizing cycles in tournaments and normalized \(q\)-norms, Inducibility and universality for trees, Minimizing the Number of Triangular Edges, Vertex Order in Some Large Constrained Random Graphs, Counting independent sets in triangle-free graphs, The clique density theorem, Rainbow triangles in three-colored graphs, A path forward: tropicalization in extremal combinatorics, On the density of a graph and its blowup, Tropicalization of graph profiles, An approximate version of Sidorenko's conjecture, Sidorenko's conjecture for blow-ups, The maximum number of induced C5's in a planar graph, Structure and supersaturation for intersecting families, On the local approach to Sidorenko's conjecture, The minimum number of triangles in graphs of given order and size, Regular Turán numbers and some Gan–Loh–Sudakov‐type problems, Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle, The phases of large networks with edge and triangle constraints, THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE, Undecidability of polynomial inequalities in weighted graph homomorphism densities, Typical large graphs with given edge and triangle densities, Finding Cliques in Social Networks: A New Distribution-Free Model, Unnamed Item, The number of additive triples in subsets of abelian groups, Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting), Asymptotic Structure of Graphs with the Minimum Number of Triangles, On the Lower Tail Variational Problem for Random Graphs, On the Number of 4-Edge Paths in Graphs With Given Edge Density, Maximal antichains of minimum size, Finitely forcible graphons with an almost arbitrary structure, Extremal results in sparse pseudorandom graphs, Edges not in any monochromatic copy of a fixed graph, Finitely forcible graphons and permutons, Minimum number of affine simplices of given dimension, On the KŁR conjecture in random graphs, Tilings in graphons, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Undecidability of linear inequalities in graph homomorphism densities, On the density of triangles and squares in regular finite and unimodular random graphs, Counting substructures. II: Hypergraphs, On the number of monotone sequences, Edge density of new graph types based on a random digraph family, Supersaturation problem for color-critical graphs, On the restriction problem for discrete paraboloid in lower dimension, On face numbers of flag simplicial complexes, On the Hamiltonicity of triple systems with high minimum degree, The feasible region of hypergraphs, On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament, Two Questions of Erdős on Hypergraphs above the Turán Threshold, Counting flags in triangle-free digraphs, Packing triangles in \(K_4\)-free graphs, Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry, An analytic approach to stability, Finitely forcible graphons, On the asymptotics of constrained exponential random graphs, Supersaturation problem for the bowtie, On the densities of cliques and independent sets in graphs, Two approaches to Sidorenko’s conjecture, On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem, Graph norms and Sidorenko's conjecture, On the Maximum Quartet Distance between Phylogenetic Trees, On clique values identities and mantel-type theorems, Frustrated triangles, The feasible region for consecutive patterns of permutations is a cycle polytope, A problem of Erdős on the minimum number of \(k\)-cliques, Books versus Triangles at the Extremal Density, The number of cliques in graphs of given order and size, Asymptotic Structure for the Clique Density Theorem, Minimizing the number of 5-cycles in graphs with given edge-density, Minimum number of edges that occur in odd cycles, Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal, Unified approach to the generalized Turán problem and supersaturation, Closing in on Hill's Conjecture, On the Number of 4-Cycles in a Tournament, Weak regularity and finitely forcible graph limits, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, Sharp bounds for decomposing graphs into edges and triangles, On the 3‐Local Profiles of Graphs, Cycles of length three and four in tournaments, A geometric theory for hypergraph matching, Paths in Hypergraphs: A Rescaling Phenomenon, Compactness and finite forcibility of graphons, On the number of edge-disjoint triangles in \(K_4\)-free graphs, Cliques in graphs with bounded minimum degree, Singularities in the entropy of asymptotically large simple graphs, The feasible region of induced graphs, Ground states for exponential random graphs, Supersaturation for subgraph counts
Cites Work
