Related papers: A topological menagerie
We provide a short proof that a 5-connected nonplanar apex graph contains a subdivided $K_{_5}$ or a $K^-_{_4}$ (= $K_{_4}$ with a single edge removed) as a subgraph. Together with a recent result of Ma and Yu that {\sl every nonplanar…
Graphs are a basic tool for the representation of modern data. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional simplicial complex. We show how topological…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
A conjecture regarding the structure of expander graphs is discussed.
We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.
The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…
The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…
We show that the cop number of the Cayley sum graph of a finite group $G$ with respect to a symmetric subset $S$ is at most twice its degree when the graph is connected, undirected. We also prove that a similar bound holds for the cop…
It is shown that for a constant $t\in \mathbb{N}$, every simple topological graph on $n$ vertices has $O(n)$ edges if it has no two sets of $t$ edges such that every edge in one set is disjoint from all edges of the other set (i.e., the…
We prove that every (6k + 2l, 2k)-connected simple graph contains k rigid and l connected edge-disjoint spanning subgraphs. This implies a theorem of Jackson and Jord\'an [4] and a theorem of Jord\'an [6] on packing of rigid spanning…
Let G be a graph with vertices V and edges E. Let F be the union-closed family of sets generated by E. Then F is the family of subsets of V without isolated points. Theorem: There is an edge e belongs to E such that |{U belongs to F | e…
We prove a sharp upper bound for the number of high degree differences in bipartite graphs: let $ (U, V, E)$ be a bipartite graph with $U=\{u_1, u_2, \dots, u_n\}$ and $V=\{v_1, v_2, \dots, v_n\}$; for $n\ge k>\frac{n}{2}$ we show that…
The presented work focuses on problems from determinant theory, set theory and topology. The term graph is the binding element that connects these problems. Graphs are distinguished by their geometrical simplicity, which helps in showing…
Throughout this work, the vertex decomposability and shellability of graphs formed from other graphs by various operations are investigated. Also among the other things, by using some graph operations, new classes of Cohen-Macaulay graphs…
The celebrated Thistlethwaite theorem relates the Jones polynomial of a link with the Tutte polynomial of the corresponding planar graph. We give a generalization of this theorem to virtual links. In this case, the graph will be embedded…
In this paper, we focus on the study of immanantal polynomials for linear combination matrices composed of the degree matrix and adjacency matrix of a graph. First, applying the concept of vertex orientation for general graphs, we provide a…
We associate all small subgraph counting problems with a systematic graph encoding/representation system which makes a coherent use of graphlet structures. The system can serve as a unified foundation for studying and connecting many…
This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…
Covering spaces of graphs have long been useful for studying expanders (as "graph lifts") and unique games (as the "label-extended graph"). In this paper we advocate for the thesis that there is a much deeper relationship between…
A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set…