Formation of a giant component in the intersection graph of a random chord diagram
From MaRDI portal
Publication:2396892
DOI10.1016/j.jctb.2017.02.001zbMath1362.05117arXiv1406.2867OpenAlexW2963624814MaRDI QIDQ2396892
Publication date: 26 May 2017
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.2867
Random graphs (graph-theoretic aspects) (05C80) Exact enumeration problems, generating functions (05A15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the connected components of a random permutation graph with a given number of edges
- The expected genus of a random chord diagram
- Chords, trees and permutations
- Poisson-Dirichlet distribution for random Belyi surfaces
- On a surface formed by randomly gluing together polygonal discs
- Application of the Berry-Esseen inequality to combinatorial estimates
- On a class of linked diagrams. II: Asymptotics
- Counting non-isomorphic chord diagrams
- Circle graph obstructions
- On a likely shape of the random Ferrers diagram
- Euler circuits and DNA sequencing by hybridization
- The genus of a random chord diagram is asymptotically normal
- A combinatorial proof of the log-concavity of a famous sequence counting permutations
- The Euler characteristic of the moduli space of curves
- The asymptotics of monotone subsequences of involutions
- The diameter of a scale-free random graph
- The genus of a random graph
- Touchard-Riordan formulas, T-fractions, and Jacobi's triple product identity
- On a uniformly random chord diagram and its intersection graph
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- Central and local limit theorems applied to asymptotic enumeration
- Another proof of the Harer-Zagier formula
- Introduction to Vassiliev Knot Invariants
- Large deviations and moments for the Euler characteristic of a random surface
- Crossings and nestings of matchings and partitions
- The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
- AN UPPER BOUND FOR THE NUMBER OF VASSILIEV KNOT INVARIANTS
- On the genus of a random graph
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- Linearized chord diagrams and an upper bound for vassiliev invariants
- Paths in graphs
- Topological characteristics of random triangulated surfaces
- On the Convolution of Logarithmically Concave Sequences
- On Dimensions of a Random Solid Diagram
- Sur Un Problème De Configurations Et Sur Les Fractions Continues
- Vassiliev invariants and a strange identity related to the Dedekind eta-function
This page was built for publication: Formation of a giant component in the intersection graph of a random chord diagram
