scientific article; zbMATH DE number 3722700
From MaRDI portal
Publication:3912837
Recommendations
Cited in
(27)- Dependence of tree copy functions
- Subgraph counting identities and Ramsey numbers
- Hopf algebra methods in graph theory
- The feasible region of hypergraphs
- Estimating the number of connected components in a graph via subgraph sampling
- Finitely forcible graphons
- Differential calculus on graphon space
- A measure theoretic perspective on the space of Feynman diagrams
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Independence in function graphs
- Densities in large permutations and parameter testing
- scientific article; zbMATH DE number 1341915 (Why is no real title available?)
- A note on the inducibility of 4-vertex graphs
- Flag algebras and the stable coefficients of the Jones polynomial
- Tropicalization of graph profiles
- Finitely forcible graphons with an almost arbitrary structure
- Undecidability of linear inequalities in graph homomorphism densities
- Counting Subgraphs in Degenerate Graphs
- Counting Homomorphic Cycles in Degenerate Graphs
- Forcing generalised quasirandom graphs efficiently
- The dimension of the region of feasible tournament profiles
- Forcing generalized quasirandom graphs efficiently (extended abstract)
- The dimension of the feasible region of pattern densities (extended abstract)
- The dimension of the feasible region of pattern densities
- Getting to the root of the problem: sums of squares for limits of trees
- Limits of dense graph sequences
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3912837)
