On the evolution of structure in triangle-free graphs

No abstract is available for this paper.

• Publication year

  2025

• Venue

  Advances in Mathematics

• Publication date

  2025-11-01

• Fields of study

  Not labeled

• Identifiers
  DOI 10.1016/j.aim.2025.110499
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density

  2024cited by this paper
• Hypergraph independence polynomials with a zero close to the origin

  2023cited by this paper
• On the zeroes of hypergraph independence polynomials

  2022cited by this paper
• Independent sets of a given size and structure in the hypercube

  2021cited by this paper
• Approximate counting and sampling via local central limit theorems

  2021cited by this paper
• Homomorphisms from the torus

  2020cited by this paper
• Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs

  2020cited by this paper
• Independent sets in the hypercube revisited

  2019cited by this paper
• Algorithmic Pirogov–Sinai theory

  2018cited by this paper
• THE METHOD OF HYPERGRAPH CONTAINERS

  2018cited by this paper
• Combinatorics and Complexity of Partition Functions

  2017cited by this paper
• On the probability of nonexistence in binomial subsets

  2017cited by this paper
• Lectures on the Ising and Potts Models on the Hypercubic Lattice

  2017cited by this paper
• The Probability of Non-Existence of a Subgraph in a Moderately Sparse Random Graph

  2016cited by this paper
• Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials

  2016cited by this paper
• The number of subsets of integers with no $k$-term arithmetic progression

  2016cited by this paper
• Zero-Free Regions of Partition Functions with Applications to Algorithms and Graph Limits

  2015cited by this paper
• Computing the Partition Function for Cliques in a Graph

  2014cited by this paper
• The number of $C_{2l}$-free graphs

  2013cited by this paper
• The typical structure of sparse $K_{r+1}$-free graphs

  2013cited by this paper
• Independent sets in hypergraphs

  2012cited by this paper
• A refinement of the Cameron–Erdős conjecture

  2012cited by this paper
• Counting sum-free sets in abelian groups

  2012cited by this paper
• Hypergraph containers

  2012cited by this paper
• Estimating and understanding exponential random graph models

  2011cited by this paper
• Phase transitions in exponential random graphs

  2011cited by this paper
• Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point

  2010cited by this paper
• Combinatorics and cluster expansions

  2010cited by this paper
• Mixing Time of Exponential Random Graphs

  2008cited by this paper
• The Cameron-Erdös conjecture

  2008cited by this paper
• An introduction to exponential random graph (p*) models for social networks

  2007cited by this paper
• Markov Graphs

  2007cited by this paper
• Cluster Expansion for Abstract Polymer Models. New Bounds from an Old Approach

  2006cited by this paper
• On the Evolution of Triangle-Free Graphs

  2005cited by this paper
• ASYMPTOTIC ENUMERATION OF Kn-FREE GRAPHS

  2004cited by this paper
• The Repulsive Lattice Gas, the Independent-Set Polynomial, and the Lovász Local Lemma

  2003cited by this paper
• For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?

  2003cited by this paper
• The Cameron–Erdős Conjecture

  2003cited by this paper
• Cameron-Erdős Modulo a Prime

  2002cited by this paper
• The Birth of the Infinite Cluster:¶Finite-Size Scaling in Percolation

  2001cited by this paper
• Almost all graphs with high girth and suitable density have high chromatic number

  2001cited by this paper
• Random Graphs, Random Triangle-Free Graphs, and Random Partial Orders

  2001cited by this paper
• On triangle-free random graphs

  2000cited by this paper
• The scaling window of the 2‐SAT transition

  1999cited by this paper
• Counting H-free graphs

  1996cited by this paper
• The perturbation method and triangle-free random graphs

  1996cited by this paper
• On the asymptotic structure of sparse triangle free graphs

  1996cited by this paper
• Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp

  1996cited by this paper
• Interfaces in the Potts model I: Pirogov-Sinai theory of the Fortuin-Kasteleyn representation

  1991cited by this paper
• A unified approach to phase diagrams in field theory and statistical mechanics

  1989cited by this paper
• _{+1}-free graphs: asymptotic structure and a 0-1 law

  1987cited by this paper
• Cluster expansion for abstract polymer models

  1986cited by this paper
• On the evolution of random graphs

  1984cited by this paper
• The central limit theorem and the problem of equivalence of ensembles

  1977cited by this paper
• Phase diagrams of classical lattice systems

  1975cited by this paper
• On an extremal problem in graph theory

  1970cited by this paper
• Correlation functions of classical gases

  1963cited by this paper
• Convergence of Fugacity Expansions for Fluids and Lattice Gases

  1963cited by this paper
• On Ising's model of ferromagnetism

  1936cited by this paper

• No citing papers are available for this paper.