Related papers: Parallel edges in ribbon graphs and interpolating …
Adjacency polytopes, a.k.a. symmetric edge polytopes, associated with undirected graphs have been defined and studied in several seemingly independent areas including number theory, discrete geometry, and dynamical systems. In particular,…
A graph H is common if the number of monochromatic copies of H in a 2-edge-colouring of the complete graph is minimised by the random colouring. Burr and Rosta, extending a famous conjecture by Erdos, conjectured that every graph is common.…
The problem of extending partial geometric graph representations such as plane graphs has received considerable attention in recent years. In particular, given a graph $G$, a connected subgraph $H$ of $G$ and a drawing $\mathcal{H}$ of $H$,…
We consider the class ${\cal A}$ of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between them). We prove that every graph $G\in{\cal A}$ different from…
We consider a problem proposed by Linial and Wilf to determine the structure of graphs that allows the maximum number of $q$-colorings among graphs with $n$ vertices and $m$ edges. Let $T_r(n)$ denote the Tur\'{a}n graph - the complete…
This paper has been withdrawn by the author. Peterson and Woodall previously proved that the list-edge-colouring conjecture holds for graphs without odd cycles of length 5 or longer. D. Peterson and D. R. Woodall, Edge-choosability in…
Let $G = (V, E)$ be a connected graph, and let $T$ in $V$ be a subset of vertices. An orientation of $G$ is called $T$-odd if any vertex $v \in V$ has odd in-degree if and only if it is in $T$. Finding a T -odd orientation of G can be…
Gessel and Sagan investigated the Tutte polynomial, $T(x,y)$ using depth first search, and applied their techniques to show that the number of acyclic partial orientations of a graph is $2^gT(3,1/2)$. We provide a short deletion-contraction…
We consider large random graphs with prescribed degrees, such as those generated by the configuration model. In the regime where the empirical degree distribution approaches a limit $\mu$ with finite mean, we establish the systematic…
The interior polynomial and the exterior polynomial are generalizations of valuations on $(1/\xi,1)$ and $(1,1/\eta)$ of the Tutte polynomial $T_G(x,y)$ of graphs to hypergraphs, respectively. The pair of hypergraphs induced by a connected…
A central theme in extremal combinatorics is the study of the maximum number of edges in an $r$-uniform hypergraph ($r$-graph) with matching number at most $s$ (the Erd\H{o}s Matching Conjecture) or with pairwise intersection at least $t$…
A rectangular dual of a graph $G$ is a contact representation of $G$ by axis-aligned rectangles such that (i)~no four rectangles share a point and (ii)~the union of all rectangles is a rectangle. The partial representation extension problem…
We associate root polytopes to directed graphs and study them by using ribbon structures. Most attention is paid to what we call the semi-balanced case, i.e., when each cycle has the same number of edges pointing in the two directions.…
In a recent paper, Hunter, Milojevi\'c, Sudakov and Tomon consider the maximum number of edges in an $n$-vertex graph containing no copy of the complete bipartite graph $K_{s,s}$ and no induced copy of a "pattern" graph $H$. They conjecture…
A normal odd partition T of the edges of a cubic graph is a partition into trails of odd length (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition and internal in some trail. For each vertex v,…
In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoint triangles. This conjecture have been proved for several…
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations.…
In this paper, we study a primal and dual relationship about triangles: For any graph $G$, let $\nu(G)$ be the maximum number of edge-disjoint triangles in $G$, and $\tau(G)$ be the minimum subset $F$ of edges such that $G \setminus F$ is…
Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minh's conjecture for wheel graphs,…
Given a graph, does there exist an orientation of the edges such that the resulting directed graph is strongly connected? Robbins' theorem [Robbins, Am. Math. Monthly, 1939] states that such an orientation exists if and only if the graph is…