On the Minimal Density of Triangles in Graphs
From MaRDI portal
Recommendations
- The minimal density of triangles in tripartite graphs
- Asymptotic structure of graphs with the minimum number of triangles
- Minimal triangulations of graphs: a survey
- On the Structure of Dense Triangle-Free Graphs
- On a property of minimal triangulations
- Density conditions for triangles in multipartite graphs
- Triangles in regular graphs with density below one half
- scientific article; zbMATH DE number 1347014
- scientific article; zbMATH DE number 1305094
- Lower bounds on the number of triangles in a graph
Cites work
Cited in
(only showing first 100 items - show all)- On a property of minimal triangulations
- A local density condition for triangles
- The local density of triangle-free graphs
- Finitely forcible graph limits are universal
- On the local approach to Sidorenko's conjecture
- The minimum number of triangles in graphs of given order and size
- Edges not in any monochromatic copy of a fixed graph
- The number of large graphs with a positive density of triangles
- Maximal antichains of minimum size
- On the restriction problem for discrete paraboloid in lower dimension
- On face numbers of flag simplicial complexes
- The feasible region of hypergraphs
- Packing triangles in \(K_4\)-free graphs
- Unified approach to the generalized Turán problem and supersaturation
- The feasible region of induced graphs
- Supersaturation for subgraph counts
- Paths of length three are \(K_{r+1}\)-Turán-good
- An extremal problem motivated by triangle-free strongly regular graphs
- A path forward: tropicalization in extremal combinatorics
- Tilings in graphons
- Finitely forcible graphons
- Minimum number of edges that occur in odd cycles
- Compactness and finite forcibility of graphons
- Singularities in the entropy of asymptotically large simple graphs
- On the density of trigraph homomorphisms
- Rainbow triangles in three-colored graphs
- Structure and supersaturation for intersecting families
- Critical graphs without triangles: an optimum density construction
- Extremal results in sparse pseudorandom graphs
- On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem
- Frustrated triangles
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Two approaches to Sidorenko's conjecture
- On the maximum quartet distance between phylogenetic trees
- On the number of 4-cycles in a tournament
- Cliques in graphs with bounded minimum degree
- Cliques in graphs with bounded minimum degree
- The number of cliques in graphs of given order and size
- The minimal density of triangles in tripartite graphs
- Ground states for exponential random graphs
- Minimizing the number of triangular edges
- Vertex order in some large constrained random graphs
- Counting independent sets in triangle-free graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Sidorenko's conjecture for blow-ups
- The clique density theorem
- Triangles in regular graphs with density below one half
- On the minimal length of the longest trail in a fixed edge-density graph
- scientific article; zbMATH DE number 1305094 (Why is no real title available?)
- The phases of large networks with edge and triangle constraints
- Weak regularity and finitely forcible graph limits
- On the asymptotics of constrained exponential random graphs
- Finitely forcible graphons and permutons
- Minimum number of affine simplices of given dimension
- On the KŁR conjecture in random graphs
- On the density of triangles and squares in regular finite and unimodular random graphs
- Counting substructures. II: Hypergraphs
- On the number of monotone sequences
- Triforce and corners
- Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal
- Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
- Sharp bounds for decomposing graphs into edges and triangles
- Finding cliques in social networks: a new distribution-free model
- Minimizing cycles in tournaments and normalized q-norms
- Inducibility and universality for trees
- Supersaturation problem for color-critical graphs
- Tropicalization of graph profiles
- The exact minimum number of triangles in graphs with given order and size
- Finding cliques in social networks: a new distribution-free model
- Finitely forcible graphons with an almost arbitrary structure
- On clique values identities and Mantel-type theorems
- Asymptotic Structure for the Clique Density Theorem
- Books versus triangles at the extremal density
- On the Hamiltonicity of triple systems with high minimum degree
- Minimizing the number of 5-cycles in graphs with given edge-density
- Closing in on Hill's conjecture
- Paths in hypergraphs: a rescaling phenomenon
- On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament
- The number of additive triples in subsets of abelian groups
- 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
- The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs
- Undecidability of linear inequalities in graph homomorphism densities
- Two questions of Erdős on hypergraphs above the Turán threshold
- On the 3-local profiles of graphs
- A geometric theory for hypergraph matching
- Subgraph densities in a surface
- On the densities of cliques and independent sets in graphs
- The feasible region for consecutive patterns of permutations is a cycle polytope
- Graph norms and Sidorenko's conjecture
- On the number of edge-disjoint triangles in \(K_4\)-free graphs
- On the density of a graph and its blowup
- The maximum number of induced C5's in a planar graph
- Regular Turán numbers and some Gan–Loh–Sudakov‐type problems
- Undecidability of polynomial inequalities in weighted graph homomorphism densities
- Typical large graphs with given edge and triangle densities
- An approximate version of Sidorenko's conjecture
- Phase transitions of structured codes of graphs
- Cycles of length three and four in tournaments
This page was built for publication: On the Minimal Density of Triangles in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527546)
