On a uniformly random chord diagram and its intersection graph
From MaRDI portal
Publication:2397541
DOI10.1016/j.disc.2016.11.004zbMath1362.05051arXiv1501.01489OpenAlexW2963972646MaRDI QIDQ2397541
Publication date: 22 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.01489
evolutionchord diagram\(k\)-coredegree of a chordintersection graph of a chord diagrammonolithic chord diagram
Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topological classification and enumeration of RNA structures by genus
- The expected genus of a random chord diagram
- Invariant tensor formulas via chord diagrams
- On a class of linked diagrams. II: Asymptotics
- Counting non-isomorphic chord diagrams
- The genus of a random chord diagram is asymptotically normal
- On the Vassiliev knot invariants
- The Euler characteristic of the moduli space of curves
- The asymptotics of monotone subsequences of involutions
- Formation of a giant component in the intersection graph of a random chord diagram
- Limiting distribution of maximal crossing and nesting of Poissonized random matchings
- The degree sequence of a scale-free random graph process
- Introduction to Vassiliev Knot Invariants
- Emergence of Scaling in Random Networks
- Crossings and nestings of matchings and partitions
- Combinatorial Computational Biology of RNA
- The Distribution of Crossings of Chords Joining Pairs of 2n Points on a Circle
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- Linearized chord diagrams and an upper bound for vassiliev invariants
- Hamilton cycles in a random tournament
- Sur Un Problème De Configurations Et Sur Les Fractions Continues
- RNA folding and large \(N\) matrix theory
This page was built for publication: On a uniformly random chord diagram and its intersection graph
