No Access

A BRACKET POLYNOMIAL FOR GRAPHS, IV: UNDIRECTED EULER CIRCUITS, GRAPH-LINKS AND MULTIPLY MARKED GRAPHS

LORENZO TRALDI

Lafayette College, Easton, PA 18042, USA

https://doi.org/10.1142/S0218216511009157Cited by:2 (Source: Crossref)

Abstract

In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated to a directed Euler system of the universe graph of D. Here we extend the graph bracket to graphs whose vertices may carry different kinds of marks, and we show how multiply marked graphs encode interlacement with respect to arbitrary (undirected) Euler systems. The extended machinery brings together the earlier version and the graph-links of Ilyutko and Manturov [J. Knot Theory Ramifications18 (2009) 791–823]. The greater flexibility of the extended bracket also allows for a recursive description much simpler than that of the earlier version.

Keywords:

AMSC: 57M25, 05C50

References

R. Arratia, B. Bollobás and G. B. Sorkin, J. Combin. Theory Ser. B 92, 199 (2004), DOI: 10.1016/j.jctb.2004.03.003. Crossref, Web of Science, Google Scholar
R. Arratia, B. Bollobás and G. B. Sorkin, Combinatorica 24, 567 (2004), DOI: 10.1007/s00493-004-0035-6. Crossref, Web of Science, Google Scholar
A. Bouchet, Discrete Math. 66, 203 (1987), DOI: 10.1016/0012-365X(87)90132-4. Crossref, Web of Science, Google Scholar
A. Bouchet, J. Combin. Theory Ser. B 45, 58 (1988). Crossref, Web of Science, Google Scholar
A. Bouchet, European J. Combin. 22, 657 (2001), DOI: 10.1006/eujc.2000.0486. Crossref, Web of Science, Google Scholar
H. R. Brahana, Ann. Math. 23, 144 (1921), DOI: 10.2307/1968030. Crossref, Google Scholar
M. Cohn and A. Lempel, J. Combin. Theory Ser. A 13, 83 (1972). Crossref, Web of Science, Google Scholar
J. H. Conway, Computational Problems in Abstract Algebra (Pergamon, 1970) pp. 329–358. Crossref, Google Scholar
W. H. Cunningham, SIAM J. Algebr. Discrete Methods 3, 214 (1982), DOI: 10.1137/0603021. Crossref, Web of Science, Google Scholar
J. A. Ellis-Monaghan and I. Sarmiento, Combin. Probab. Comput. 16, 947 (2007). Crossref, Web of Science, Google Scholar
R. Fenn, L. H. Kauffman and V. O. Manturov, Fund. Math. 188, 293 (2005), DOI: 10.4064/fm188-0-13. Crossref, Web of Science, Google Scholar
C. Godsil and G. Royle , Algebraic Graph Theory , Graduate Texts in Mathematics 207 ( Springer-Verlag , Berlin , 2001 ) . Crossref, Google Scholar
D. P. Ilyutko, An equivalence between the set of graph-knots and the set of homotopy classes of looped graphs, to appear in J. knot Theory Ramifications . Google Scholar
D. P. Ilyutko and V. O. Manturov, J. Knot Theory Ramifications 18, 791 (2009). Link, Web of Science, Google Scholar
D. P. Ilyutko and V. O. Manturov, Graph-links, preprint (2010) , arXiv: 1001.0384v1 . Google Scholar
F. Jaeger, J. Combin. Theory Ser. B 44, 127 (1988). Crossref, Web of Science, Google Scholar
V. F. R. Jones, Bull. Amer. Math. Soc. 12, 103 (1985), DOI: 10.1090/S0273-0979-1985-15304-2. Crossref, Web of Science, Google Scholar
L. H. Kauffman, Topology 26, 395 (1987). Crossref, Web of Science, Google Scholar
L. H. Kauffman, European J. Combin. 20, 663 (1999), DOI: 10.1006/eujc.1999.0314. Crossref, Web of Science, Google Scholar
L. H. Kauffman , Handbook of Knot Theory , eds. W. Menasco and M. Thistlethwaite ( Elsevier , Amsterdam , 2005 ) . Crossref, Google Scholar
A. Kotzig, Theory of Graphs (Academic Press, New York, 1968) pp. 219–230. Google Scholar
M. Las Vergnas, Algebraic Methods in Graph Theory, Colloquia Mathematica Societatis János Bolyai 25 (North-Holland, Amsterdam, 1981) pp. 451–477. Google Scholar
V. O. Manturov, A proof of V. A. Vassiliev's conjecture on the planarity of singular links, Izv. Ross. Akad. Nauk Ser. Mat. 69 (2005) 169–178 (Russian); Izv. Math. 69 (2005) 1025–1033 (English) . Google Scholar
P. Martin, Enumérations eulériennes dans les multigraphes et invariants de Tutte–Grothendieck, Thèse (1977), Grenoble . Google Scholar
B. Mellor, Michigan Math. J. 51, 509 (2003), DOI: 10.1307/mmj/1070919557. Crossref, Web of Science, Google Scholar
O.-P. Östlund, J. Knot Theory Ramifications 10, 1215 (2001). Link, Web of Science, Google Scholar
P. A. Pevzner, Algorithmica 13, 77 (1995), DOI: 10.1007/BF01188582. Crossref, Web of Science, Google Scholar
M. Polyak, Minimal sets of Reidemeister moves, preprint (2009) , arXiv:0908.3127v2 . Google Scholar
C. V. Quach Hongler and C. Weber, J. Knot Theory Ramifications 17, 1387 (2008). Link, Web of Science, Google Scholar
R. C. Read and P. Rosenstiehl, Combinatorics, Colloquia Mathematica Societatis János Bolyai 18 (North-Holland, Amsterdam, 1978) pp. 843–876. Google Scholar
E. Soboleva, J. Knot Theory Ramifications 10, 161 (2001). Link, Web of Science, Google Scholar
M. B. Thistlethwaite, Topology 26, 297 (1987), DOI: 10.1016/0040-9383(87)90003-6. Crossref, Web of Science, Google Scholar
L. Traldi, J. Knot Theory Ramifications 19, 547 (2010). Link, Web of Science, Google Scholar
L. Traldi, European J. Combin. 32, 944 (2011), DOI: 10.1016/j.ejc.2011.02.004. Crossref, Web of Science, Google Scholar
L. Traldi, J. Knot Theory Ramifications 20, 435 (2011). Link, Web of Science, Google Scholar
L. Traldi and L. Zulli, J. Knot Theory Ramifications 18, 1681 (2009). Link, Web of Science, Google Scholar
E. Ukkonen, Theoret. Comput. Sci. 92, 191 (1992), DOI: 10.1016/0304-3975(92)90143-4. Crossref, Web of Science, Google Scholar
L. Zulli, Topology 34, 717 (1995), DOI: 10.1016/0040-9383(94)00041-I. Crossref, Web of Science, Google Scholar