Counting graph homomorphisms
From MaRDI portal
Recommendations
Cited in
(99)- Homomorphisms and Polynomial Invariants of Graphs
- Identifiability for graphexes and the weak kernel metric
- In praise of homomorphisms
- Matroid invariants and counting graph homomorphisms
- Colored graph homomorphisms
- On recognizing graphs by numbers of homomorphisms
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Gadget construction and structural convergence
- Many Facets of Dualities
- Dismantlability, Connectedness, and Mixing in Relational Structures
- Limits of kernel operators and the spectral regularity lemma
- Random graphs with a given degree sequence
- Stochastic Block Smooth Graphon Model
- Counting Subgraphs via Homomorphisms
- Dismantlability, connectedness, and mixing in relational structures
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On the continuum limit of epidemiological models on graphs: convergence and approximation results
- Weighted exponential random graph models: scope and large network limits
- Countable homogeneous multipartite graphs
- Mean-field limit of non-exchangeable systems
- Graph norms and Sidorenko's conjecture
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Colouring, constraint satisfaction, and complexity
- Bounded degree nonnegative counting CSP
- Matrix estimation by universal singular value thresholding
- Rooting algebraic vertices of convergent sequences (extended abstract)
- An algorithm for the number of path homomorphisms
- Sampling perspectives on sparse exchangeable graphs
- Limits of random trees. II
- Graph homomorphisms, the tutte polynomial and ``\(q\)-state Potts uniqueness
- Bounds on the mod 2 homology of random 2-dimensional determinantal hypertrees
- Random homomorphisms into the orthogonality graph
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Computing the partition function for graph homomorphisms
- \(\Gamma\)-limit of the cut functional on dense graph sequences
- On the asymptotics of constrained exponential random graphs
- Faster algorithms for finding and counting subgraphs
- An analytic approach to stability
- Counting \(H\)-free graphs
- scientific article; zbMATH DE number 6691415 (Why is no real title available?)
- Independent sets in graphs
- Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
- A detailed investigation into near degenerate exponential random graphs
- Perfect matchings, rank of connection tensors and graph homomorphisms
- On a question of Vera T. Sós about size forcing of graphons
- Limits of randomly grown graph sequences
- The complexity of counting surjective homomorphisms and compactions
- Ordered graph limits and their applications
- Limit theorems for exponential random graphs
- Moments of two-variable functions and the uniqueness of graph limits
- Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2
- Distinguishing graphs by their left and right homomorphism profiles
- Structural convergence and algebraic roots
- The homomorphism domination exponent
- On counting (quantum-)graph homomorphisms in finite fields of prime order
- Graphon convergence of random cographs
- Estimating and understanding exponential random graph models
- Semidefinite functions on categories
- An introduction to large deviations for random graphs
- On network-based epidemiological models: analysis, simulations, and continuum limit
- Strongly polynomial sequences as interpretations
- Testing properties of graphs and functions
- Generalized quasirandom graphs
- Ordinal motifs in lattices
- Monotone arithmetic complexity of graph homomorphism polynomials
- Locally common graphs
- An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
- The complexity of counting homomorphisms to cactus graphs modulo 2
- Asymptotic behavior and distributional limits of preferential attachment graphs
- Homomorphisms of trees into a path
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth
- The large deviation principle for the Erdős-Rényi random graph
- Counting homomorphisms to sparse graphs
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- Polynomial graph invariants from homomorphism numbers
- A surprising permanence of old motivations (a not-so-rigid story)
- Reflection positivity, rank connectivity, and homomorphism of graphs
- Faster algorithms for counting subgraphs in sparse graphs
- How many F's are there in G?
- Positivstellensätze for quantum multigraphs
- Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality
- On counting homomorphisms to directed acyclic graphs
- Limits of dense graph sequences
- Limits of sparse configuration models and beyond: graphexes and multigraphexes
- Perspectives on exponential random graphs
- Percolation on dense graph sequences
- Homomorphisms and polynomial invariants of graphs
- The rank of edge connection matrices and the dimension of algebras of invariant tensors
- The number of cliques in graphs of given order and size
- Structural Properties of Sparse Graphs
- Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph
- Sparse exchangeable graphs and their limits via graphon processes
- scientific article; zbMATH DE number 7559121 (Why is no real title available?)
- A representation theorem for (q-)holonomic sequences
- Finitely forcible graphons
- scientific article; zbMATH DE number 1156638 (Why is no real title available?)
- Existence of modeling limits for sequences of sparse structures
- On the boundary of the region defined by homomorphism densities
This page was built for publication: Counting graph homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3424888)
