Ordered and colored subgraph density problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3821782 (Why is no real title available?)
- scientific article; zbMATH DE number 3745218 (Why is no real title available?)
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3185004 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- Graphs with maximal number of adjacent pairs of edges
- Hypergraph limits: A regularity approach
- Large networks and graph limits
- Lower bounds on the number of triangles in a graph
- Maximum star densities
- On Sets of Acquaintances and Strangers at any Party
- On the Maximum Induced Density of Directed Stars and Related Problems
- On the Minimal Density of Triangles in Graphs
- The clique density theorem
- The feasible region of induced graphs
- The inducibility of oriented stars
- The number of cliques in graphs of given order and size
- Triangles in an Ordinary Graph
This page was built for publication: Ordered and colored subgraph density problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6668349)