Linearized chord diagrams and an upper bound for vassiliev invariants

DOI10.1142/S0218216500000475zbMath0997.57028OpenAlexW2071886810MaRDI QIDQ4541146

Oliver Riordan, Béla Bollobás

Publication date: 30 July 2002

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218216500000475

Mathematics Subject Classification ID

Related Items (8)

Formation of a giant component in the intersection graph of a random chord diagram ⋮ On a uniformly random chord diagram and its intersection graph ⋮ Giant descendant trees, matchings, and independent sets in age-biased attachment graphs ⋮ On Bollobás‐Riordan random pairing model of preferential attachment graph ⋮ The combinatorics of a tree-like functional equation for connected chord diagrams ⋮ APPLICATION OF BRAIDING SEQUENCES, I: ON THE CHARACTERIZATION OF VASSILIEV AND POLYNOMIAL LINK INVARIANTS ⋮ Connected chord diagrams and bridgeless maps ⋮ Popularity based random graph models leading to a scale-free degree sequence

Cites Work

• Stirling numbers of the second kind
• On the Vassiliev knot invariants
• AN UPPER BOUND FOR THE NUMBER OF VASSILIEV KNOT INVARIANTS
• ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS

This page was built for publication: Linearized chord diagrams and an upper bound for vassiliev invariants