Related papers: Enumeration formulas for (3, 6)-fullerenes
Consider factorizations into transpositions of an n-cycle in the symmetric group S_n. To every such factorization we assign a monomial in variables w_{ij} that retains the transpositions used, but forgets their order. Summing over all…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
We determine the number of labelled chordal planar graphs with $n$ vertices, which is asymptotically $c_1\cdot n^{-5/2} \gamma^n n!$ for a constant $c_1>0$ and $\gamma \approx 11.89235$. We also determine the number of rooted simple chordal…
A graph is square-complementary (squco, for short) if its square and complement are isomorphic. We prove that there are no squco graphs with girth 6, that every bipartite graph is an induced subgraph of a squco bipartite graph, that the…
This article reports the occurrence of binary quadratic forms in primitive Pythagorean triangles and their geometric interpretation. In addition to the well-known fact that the hypotenuse, z, of a right triangle, with sides of integral…
For a planar graph with a given f-vector $(f_{0}, f_{1}, f_{2}),$ we introduce a cubic polynomial whose coefficients depend on the f-vector. The planar graph is said to be real if all the roots of the corresponding polynomial are real. Thus…
A central issue in molecular orbital theory is to compute the HOMO-LUMO gap of a molecule, which measures the excitability of the molecule. Thus it would be of interest to learn how to construct a molecule with the prescribed HOMO-LUMO gap.…
The \emph{segment number} of a planar graph is the smallest number of line segments whose union represents a crossing-free straight-line drawing of the given graph in the plane. The segment number is a measure for the visual complexity of a…
A matching set $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. In this paper we consider some parameters related to the matching of regular graphs. We find the sixth coefficient of the…
We observe that fullerene graphs are one-skeletons of polyhedra, which can be realized with all dihedral angles equal to $\pi/2$ in a hyperbolic 3-dimensional space. One of the most important invariants of such a polyhedron is its volume.…
Let G be a finite planar connected graph without loops or multiple edges. All minimal circuits except atmost one - say C* - are triangles. Let k be the number of vertices of C*. There are at least 2**(k-3) colorings of the vertices of G…
A graph is universally $k$-edge-weightable if for every $k$-element set $Q\subset\mathbb{R}$, it admits a proper $Q$-edge weighting. The settled 1-2-3 conjecture implies that for any arithmetic progression $\{a,b,c\}$, every nice regular…
We initiate the study of extremal problems about faces in convex rectilinear drawings of~$K_n$, that is, drawings where vertices are represented by points in the plane in convex position and edges by line segments between the points…
In this paper, we prove abundance for non-uniruled 3-folds with non-trivial Albanese maps, over an algebraically closed field of characteristic $p > 5$. As an application we get a characterization of abelian 3-folds.
We give a complete description of all solutions to the equation $f_1^3 + f_2^3 = f_3^3 + f_4^3$ for quadratic forms $f_j \in \mathbb C[x,y]$ and show how Ramanujan's example can be extended to three equal sums of pairs of cubes. We also…
A positive-definite integral quadratic form is called regular if it represents every positive integer which is locally represented. In this article, we classify all regular diagonal quadratic forms of rank greater than 3.
Kneser-Haken Finiteness asserts that for each compact 3-manifold M there is an integer c(M) such that any collection of k>c(M) closed, essential, 2-sided surfaces in M must contain parallel elements. We show here that if M is closed then…
We propose an effective algorithm that enumerates (and actually finds) all 3-edge colorings and Hamiltonian cycles in a cubic graph. The idea is to make a preliminary run that separates the vertices into two types: ``rigid'' (such that the…
A graph G = (V,E) is called fully regular if for every independent set $I\subset V$ , the number of vertices in $V\setminus$ I that are not connected to any element of I depends only on the size of I. A linear ordering of the vertices of G…
We give examples of closed, oriented 3-manifolds whose fundamental groups are not isomorphic, but yet have the same sets of finite quotient groups; hence the same profinite completions. We also give examples of compact, oriented 3-manifolds…