Pages that link to "Item:Q4541146"
From MaRDI portal
The following pages link to Linearized chord diagrams and an upper bound for vassiliev invariants (Q4541146):
Displaying 15 items.
- A lower bound for the number of Vassiliev knot invariants (Q1292732) (← links)
- Exact number of chord diagrams and an estimation of the number of spine diagrams of order \(n\) (Q1367237) (← links)
- Popularity based random graph models leading to a scale-free degree sequence (Q1827728) (← links)
- On the number of chord diagrams (Q1978157) (← links)
- Connected chord diagrams and bridgeless maps (Q2278114) (← links)
- Formation of a giant component in the intersection graph of a random chord diagram (Q2396892) (← links)
- On a uniformly random chord diagram and its intersection graph (Q2397541) (← links)
- APPLICATION OF BRAIDING SEQUENCES, I: ON THE CHARACTERIZATION OF VASSILIEV AND POLYNOMIAL LINK INVARIANTS (Q3056464) (← links)
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS (Q4393494) (← links)
- Vassiliev invariants and the Hopf algebra of chord diagrams (Q4877643) (← links)
- Giant descendant trees, matchings, and independent sets in age-biased attachment graphs (Q5086992) (← links)
- (Q5699371) (← links)
- On Bollobás‐Riordan random pairing model of preferential attachment graph (Q6074644) (← links)
- The combinatorics of a tree-like functional equation for connected chord diagrams (Q6204690) (← links)
- Tubings, chord diagrams, and Dyson-Schwinger equations (Q6641581) (← links)