Related papers: On rigidity of toric varieties arising from bipart…
Every cohomology ring isomorphism between two non-singular complete toric varieties and quasitoric manifolds, respectively, with second Betti number $2$ is realizable by a diffeomorphism and homeomorphism, respectively.
In this paper we define and study a ring associated to a graph that we call the cographic toric face ring, or simply the cographic ring. The cographic ring is the toric face ring defined by the following equivalent combinatorial structures…
We characterize the bipartite graphs that minimize the (first-degree based) entropy, among all bipartite graphs of given size, or given size and (upper bound on the) order. The extremal graphs turn out to be complete bipartite graphs, or…
We consider the set of forms of a toric variety over an arbitrary field: those varieties which become isomorphic to a toric variety after base field extension. In contrast to most previous work, we also consider arbitrary isomorphisms…
We give a necessary and sufficient condition for the nonsingular projective toric variety associated to the graph cubeahedron of a finite simple graph to be Fano or weak Fano in terms of the graph.
I extend the definitions of schemes relative to monoids with zero - and therefore, toric geometry - to the world of formal schemes. This expands the usual framework to include, for instance, models for Mumford's degenerating Abelian…
We study the cohomological rigidity problem of two families of manifolds with torus actions: the so-called moment-angle manifolds, whose study is linked with combinatorial geometry and combinatorial commutative algebra; and topological…
In this article, we prove a rigidity criterion for period maps of admissible variations of graded-polarizable mixed Hodge structure, and establish rigidity in a number of cases, including families of quasi-projective curves, projective…
Biregular bipartite graphs have been proven to have similar edge distributions to random bipartite graphs and thus have nice pseudorandomness and expansion properties. Thus it is quite desirable to find a biregular bipartite spanning…
The $k$-token graph $T_k(G)$ is the graph whose vertices are the $k$-subsets of vertices of a graph $G$, with two vertices of $T_k(G)$ adjacent if their symmetric difference is an edge of $G$. We explore when $T_k(G)$ is a well-covered…
It is known that toric ring of a simple polyomino is ring homomorphic to a edge ring of a weakly chordal bipartite graph. In this paper we identify the toric ring of nonsimple polyominoes which are of the form "rectangle minus rectangle".
The (torsion) complexity of a finite signed graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When $G$ is $d$-periodic (i.e., $G$ has a free ${\mathbb Z}^d$-action by graph…
A toric variety is called fibered if it can be represented as a total space of fibre bundle over toric base and with toric fiber. Fibered toric varieties form a special case of toric variety bundles. In this note we first give an…
In this paper, we study the type graph, namely, a bipartite graph induced by a joint type. We investigate the maximum edge density of induced bipartite subgraphs of this graph having a number of vertices on each side on an exponential scale…
We describe the equivariant cobordism ring of smooth toric varieties. This equivariant description is used to compute the ordinary cobordism ring of such varieties.
Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…
Toric varieties are a special class of rational varieties defined by equations of the form {\it monomial = monomial}. For a good brief survey of the history and role of toric varieties see [10]. Any toric variety $X$ contains a cover by…
In this short note we prove the Borel conjecture for a family of aspherical manifolds that includes higher graph manifolds.
When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…
A strong edge-coloring of a graph $G$ is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of maximum degree at most $3$ and the other part is of maximum…