Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Sergei Chmutov"'
Autor:
Sergei Chmutov
Publikováno v:
Handbook of the Tutte Polynomial and Related Topics ISBN: 9780429161612
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b87338f074d6ab1bff778b8ad66bf5a1
https://doi.org/10.1201/9780429161612-27
https://doi.org/10.1201/9780429161612-27
Publikováno v:
European Journal of Combinatorics
European Journal of Combinatorics, Elsevier, 2021, 97, pp.103368. ⟨10.1016/j.ejc.2021.103368⟩
European Journal of Combinatorics, Elsevier, 2021, 97, pp.103368. ⟨10.1016/j.ejc.2021.103368⟩
International audience; Partial duality is a duality of ribbon graphs relative to a subset of their edges generalizing the classical Euler-Poincaré duality. This operation often changes the genus. Recently J. L. Gross, T. Mansour, and T. W. Tucker f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e3e3432dc5f40a6bfb482c5c490ab3fb
https://hal.archives-ouvertes.fr/hal-03121632v2/document
https://hal.archives-ouvertes.fr/hal-03121632v2/document
Publikováno v:
Selecta Mathematica. 26
We prove that the generating function for the symmetric chromatic polynomial of all connected graphs satisfies (after appropriate scaling change of variables) the Kadomtsev--Petviashvili integrable hierarchy of mathematical physics. Moreover, we desc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aa0348bbf7bc2b78cfe1819a00803188
https://doi.org/10.1007/s00029-020-00562-w
https://doi.org/10.1007/s00029-020-00562-w
Autor:
Jake Huryn, Sergei Chmutov
Publikováno v:
Involve 13, no. 1 (2020), 109-116
A well-known open problem in graph theory asks whether Stanley’s chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two nonisomorphic trees. Previous work has proven the conjecture for a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f9393bead9c44b198f2e9ad44659359
http://arxiv.org/abs/1901.04034
http://arxiv.org/abs/1901.04034
Autor:
Clark Butler, Sergei Chmutov
Publikováno v:
Arnold Mathematical Journal. 1:283-298
We establish a relation between the Bollobas–Riordan polynomial of a ribbon graph with the relative Tutte polynomial of a plane graph obtained from the ribbon graph using its projection to the plane in a nontrivial way. Also we give a duality formu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5985dffd0403687157d0516f60c31de9
https://doi.org/10.1007/s40598-015-0021-7
https://doi.org/10.1007/s40598-015-0021-7
Publikováno v:
Journal of Combinatorial Theory, Series A. 123:186-201
Recently V. Krushkal and D. Renardy generalized the Tutte polynomial from graphs to cell complexes. We show that evaluating this polynomial at the origin gives the number of cellular spanning trees in the sense of A. Duval, C. Klivans, and J. Martin.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5e46ea8be73099b9014dae33f46b3bbe
https://doi.org/10.1016/j.jcta.2013.12.006
https://doi.org/10.1016/j.jcta.2013.12.006
Autor:
Boris Pittel, Sergei Chmutov
Publikováno v:
Journal of Combinatorial Theory, Series A. 120(1):102-110
Let $G_n$ be the genus of a two-dimensional surface obtained by gluing, uniformly at random, the sides of an $n$-gon. Recently Linial and Nowik proved, via an enumerational formula due to Harer and Zagier, that the expected value of $G_n$ is asymptot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6892a0954c63db3b3f5801e457005787
Publikováno v:
Quantum Topology. 4:77-90
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the polynomial, de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7030e90b597c1f37377074aedd092629
https://doi.org/10.4171/qt/35
https://doi.org/10.4171/qt/35
Publikováno v:
Journal of Knot Theory and its Ramifications
We describe the Polyak-Viro arrow diagram formulas for the coefficients of the Conway polynomial. As a consequence, we obtain the Conway polynomial as a state sum over some subsets of the crossings of the knot diagram. It turns out to be a simplifica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4234a00bc08ed75359b58e907196d904
https://doi.org/10.1142/s0218216509007154
https://doi.org/10.1142/s0218216509007154
Publikováno v:
European Journal of Combinatorics. 29:311-321
In this paper we prove the knight move theorem for the chromatic graph cohomologies with rational coefficients introduced by L. Helme-Guizon and Y. Rong. Namely, for a connected graph @C with n vertices the only non-trivial cohomology groups H^i^,^n^
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::784113d1df11472f33d2560377b6c3c8
https://doi.org/10.1016/j.ejc.2006.07.009
https://doi.org/10.1016/j.ejc.2006.07.009