Linking number and writhe in random linear embeddings of graphs

DOI10.1007/s10910-016-0610-2zbMath1346.92082arXiv1508.01183OpenAlexW2963729988MaRDI QIDQ298067

Erica Flapan, Kenji Kozai

Publication date: 20 June 2016

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.01183

zbMATH Keywords

entanglementconfined polymerslinear embeddings of graphslinking in spatial graphspolymer topology

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items

Models of random knots ⋮ Stick number of tangles ⋮ Stick number of non-paneled knotless spatial graphs ⋮ Linking number of monotonic cycles in random book embeddings of complete graphs ⋮ Recent developments in spatial graph theory ⋮ Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs ⋮ Filling random cycles

Cites Work

• A refinement of the Conway-Gordon theorems
• On the number of links in a linearly embedded K_3,3,1
• On the mean and variance of the writhe of random polygons
• Knots and links in spatial graphs
• The linking number and the writhe of uniform random walks and polygons in confined spaces
• Linking of uniform random polygons in confined spaces
• The growth of the mean average crossing number of equilateral polygons in confinement
• ON RANDOM KNOTS
• Generating random walks and polygons with stiffness in confinement
• Linear embeddings of K₉ are triple linked
• KNOTS AND LINKS IN LINEAR EMBEDDINGS OF K₆
• Random Graphs
• Ramsey Theorems for Knots, Links and Spatial Graphs