相关论文: Orientable triangular embeddings of the complete g…

The regular embeddings of complete bipartite graphs $K_{n,n}$ in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in…

An oriented graph is an orientation of a simple graph. In 2009, Keevash, K\"{u}hn and Osthus proved that every sufficiently large oriented graph $D$ of order $n$ with $(3n-4)/8$ is Hamiltonian. Later, Kelly, K\"{u}hn and Osthus showed that…

A graph drawn in a surface is a near-quadrangulation if the sum of the lengths of the faces different from 4-faces is bounded by a fixed constant. We leverage duality between colorings and flows to design an efficient algorithm for…

We prove a conjecture of Menasco and Zhang that if a tangle is completely tubing compressible then it consists of at most two families of parallel strands. This is related to problems of graphs in 3-manifold. A 1-vertex graph $\Gamma$ in a…

Nash-Williams proved in 1960 that a finite graph admits a $k$-arc-connected orientation if and only if it is $2k$-edge-connected, and conjectured that the same result should hold for all infinite graphs, too. Progress on Nash-Williams's…

Motivated by a conjecture of Gy\'arf\'as, recently B\"ottcher, Hladk\'y, Piguet, and Taraz showed that every collection $T_1,\dots,T_t$ of trees on $n$ vertices with $\sum_{i=1}^te(T_i)\leq \binom{n}{2}$ and with bounded maximum degree, can…

A {\em $1-$vertex triangulation} of an oriented compact surface $S$ of genus $g$ is an embedded graph $T\subset S$ with a unique vertex such that all connected components of $S\setminus T$ are triangles (adjacent to exactly 3 edges of $T$).…

Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…

For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…

In 1988, Erd\H{o}s suggested the question of minimizing the number of edges in a connected $n$-vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In…

In edge orientations, the goal is usually to orient (direct) the edges of an undirected $n$-vertex graph $G$ such that all out-degrees are bounded. When the graph $G$ is fully dynamic, i.e., admits edge insertions and deletions, we wish to…

Let $G$ be the circulant graph $C_n(S)$ with $S\subseteq\{ 1,\ldots,\left \lfloor\frac{n}{2}\right \rfloor\}$ and let $\Delta$ be its independence complex. We describe the well-covered circulant graphs with 2-dimensional $\Delta$ and…

In 1974, Erd\H{o}s asked the following question: given a graph $G$ and a directed graph $\vec{H}$, how many ways are there to orient the edges of $G$ such that it does not contain $\vec{H}$ as a subgraph? We denote this value by $D(G,…

Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…

We prove that every graph $G$ on $n$ vertices with no isolated vertices contains an induced subgraph of size at least $n/10000$ with all degrees odd. This solves an old and well-known conjecture in graph theory.

We introduce and study the problem of optimizing arbitrary functions over degree sequences of hypergraphs and multihypergraphs. We show that over multihypergraphs the problem can be solved in polynomial time. For hypergraphs, we show that…

We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain…

Given a graph, when can we orient the edges to satisfy local constraints at the vertices, where each vertex specifies which local orientations of its incident edges are allowed? This family of graph orientation problems is a special kind of…

We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…

We describe a construction for embeddings of complete graphs where the dual has a cutvertex and the genus is close to the minimum genus of the primal graph. When the number of vertices is congruent to 5 modulo 12, we further guarantee that…