scientific article

Vera T. Sós, Katalin Vesztergombi, Christian Borgs, Jennifer T. Chayes

Publication date: 5 March 2007

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Convergence and divergence of series and sequences (40A05) Equilibrium statistical mechanics (82B99) Graph theory (05C99)

Related Items (72)

Perfect matchings, rank of connection tensors and graph homomorphisms ⋮ In praise of homomorphisms ⋮ Four Shorts Stories on Surprising Algorithmic Uses of Treewidth ⋮ Weighted exponential random graph models: scope and large network limits ⋮ The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems ⋮ Moments of two-variable functions and the uniqueness of graph limits ⋮ A detailed investigation into near degenerate exponential random graphs ⋮ Strongly polynomial sequences as interpretations ⋮ Testing properties of graphs and functions ⋮ A representation theorem for ($q$-)holonomic sequences ⋮ Locally common graphs ⋮ On a question of Vera T. Sós about size forcing of graphons ⋮ Graphon convergence of random cographs ⋮ Monotone arithmetic complexity of graph homomorphism polynomials ⋮ Homomorphisms and Polynomial Invariants of Graphs ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants ⋮ Γ-limit of the cut functional on dense graph sequences ⋮ Ordinal motifs in lattices ⋮ The rank of edge connection matrices and the dimension of algebras of invariant tensors ⋮ Polynomial graph invariants from homomorphism numbers ⋮ Many Facets of Dualities ⋮ Faster algorithms for finding and counting subgraphs ⋮ Random graphs with a given degree sequence ⋮ Asymptotic behavior and distributional limits of preferential attachment graphs ⋮ Estimating and understanding exponential random graph models ⋮ Convergent sequences of dense graphs. II. Multiway cuts and statistical physics ⋮ Limits of randomly grown graph sequences ⋮ The large deviation principle for the Erdős-Rényi random graph ⋮ Distinguishing graphs by their left and right homomorphism profiles ⋮ The homomorphism domination exponent ⋮ How many $F$'s are there in $G$? ⋮ Limits of kernel operators and the spectral regularity lemma ⋮ Colouring, constraint satisfaction, and complexity ⋮ Dismantlability, connectedness, and mixing in relational structures ⋮ Positivstellensätze for quantum multigraphs ⋮ Identifiability for Graphexes and the Weak Kernel Metric ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Perspectives on exponential random graphs ⋮ Approximating the cumulant generating function of triangles in the Erdös-Rényi random graph ⋮ Generalized quasirandom graphs ⋮ Independent sets in graphs ⋮ An $L^{p}$ theory of sparse graph convergence. II: LD convergence, quotients and right convergence ⋮ Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing ⋮ Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality ⋮ Sparse exchangeable graphs and their limits via graphon processes ⋮ Percolation on dense graph sequences ⋮ An analytic approach to stability ⋮ Finitely forcible graphons ⋮ Unnamed Item ⋮ On the asymptotics of constrained exponential random graphs ⋮ Sampling perspectives on sparse exchangeable graphs ⋮ Graph norms and Sidorenko's conjecture ⋮ Faster algorithms for counting subgraphs in sparse graphs ⋮ Colored graph homomorphisms ⋮ The number of cliques in graphs of given order and size ⋮ Consistent nonparametric estimation for heavy-tailed sparse graphs ⋮ EXISTENCE OF MODELING LIMITS FOR SEQUENCES OF SPARSE STRUCTURES ⋮ An introduction to large deviations for random graphs ⋮ Dismantlability, Connectedness, and Mixing in Relational Structures ⋮ The Complexity of Counting Surjective Homomorphisms and Compactions ⋮ Limits of sparse configuration models and beyond: graphexes and multigraphexes ⋮ Homomorphisms and polynomial invariants of graphs ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ Homomorphisms of Trees into a Path ⋮ Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness” ⋮ Counting Homomorphisms to Sparse Graphs ⋮ Structural Properties of Sparse Graphs ⋮ Matrix estimation by universal singular value thresholding ⋮ Limits of random trees. II ⋮ Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 ⋮ Matroid invariants and counting graph homomorphisms

This page was built for publication: