Results 51 to 60 of about 1,286,422 (323)
Embeddings and immersions of tropical curves [PDF]
, 2015 We construct immersions of trivalent abstract tropical curves in the Euclidean plane and embeddings of all abstract tropical curves in higher dimensional Euclidean space.
Cartwright, Dustin +3 more
core +1 more source
On the Crossing Numbers of Cartesian Products of Wheels and Trees
Discussiones Mathematicae Graph Theory, 2017 Bokal developed an innovative method for finding the crossing numbers of Cartesian product of two arbitrarily large graphs. In this article, the crossing number of the join product of stars and cycles are given.
Klešč Marián +2 more
doaj +1 more source
Immersed disks, slicing numbers and concordance unknotting numbers [PDF]
, 2015 We study three knot invariants related to smoothly immersed disks in the four-ball. These are the four-ball crossing number, which is the minimal number of normal double points of such a disk bounded by a given knot; the slicing number, which is the ...
Owens, Brendan, Strle, Saso
core +3 more sources
On the number of crossed homomorphisms
Hokkaido Mathematical Journal, 1999 The authors verify for some new classes of groups conjectures concerning the number of homomorphisms and crossed homomorphisms, respectively. These conjectures state that (H) \(|\text{Hom}(A,G)|\equiv 0\bmod\gcd(|A/A'|,|G|)\) and (I) \(|Z^1(C,H)|\equiv 0\bmod\gcd(|C|,|H|)\), where \(A\), \(G\), \(C\), \(H\) are finite groups, \(C\) is an Abelian \(p ...
ASAI, Tsunenobu, TAKEGAHARA, Yugen
openaire +2 more sources
New Bounds on Crossing Numbers [PDF]
Discrete & Computational Geometry, 1999 The notation \(f(n)\ll g(n)\) means that, as \(n\) goes to infinity, \(g(n)/f(n)\) goes to infinity also. For \(g\geq 0\), let \(S_g\) denote the closed orientable 2-manifold of genus \(g\), with \(\text{cr}_g(G)\) the minimum number of crossing points among all drawings of the graph \(G\) on \(S_g\).
János Pach, Joel Spencer, Géza Tóth
openaire +4 more sources
On the Crossing Numbers of Cartesian Products of Stars and Graphs of Order Six
Discussiones Mathematicae Graph Theory, 2013 The crossing number cr(G) of a graph G is the minimal number of crossings over all drawings of G in the plane. According to their special structure, the class of Cartesian products of two graphs is one of few graph classes for which some exact values of ...
Klešč Marián, Schrötter Štefan
doaj +1 more source
The Crossing Number of Join of a Special Disconnected 6-Vertex Graph with Cycle
Mathematics, 2023 The crossing number of a graph G, cr(G), is defined as the smallest possible number of edge-crossings in a drawing of G in the plane. There are almost no results concerning crossing number of join of a disconnected 6-vertex graph with cycle. The main aim
Zongpeng Ding, Xiaomei Qian
doaj +1 more source
Crossing numbers of composite knots and spatial graphs [PDF]
, 2018 We study the minimal crossing number $c(K_{1}\# K_{2})$ of composite knots $K_{1}\# K_{2}$, where $K_1$ and $K_2$ are prime, by relating it to the minimal crossing number of spatial graphs, in particular the $2n$-theta curve $\theta_{K_{1},K_{2}}^n$ that
Bode, Benjamin
core +3 more sources
The Crossing Numbers of Join of Some Graphs with n Isolated Vertices
Discussiones Mathematicae Graph Theory, 2018 There are only few results concerning crossing numbers of join of some graphs. In this paper, for some graphs on five vertices, we give the crossing numbers of its join with n isolated vertices.
Ding Zongpeng, Huang Yuanqiu
doaj +1 more source
Anomalous fermion number nonconservation: Paradoxes in the level crossing picture [PDF]
, 2006 In theories with anomalous fermion number nonconservation, the level crossing picture is considered a faithful representation of the fermionic quantum number variation.
Burnier, Yannis
core +2 more sources