相关论文: Expanding graphs, Ramanujan graphs, and 1-factor p…

For a nonnegative integer $k$, a graph $G$ is said to be $k$-factor-critical if $G-Q$ admits a perfect matching for any $Q\subseteq V(G)$ with $|Q|=k$. In this article, we prove spectral radius conditions for the existence of…

In the k-Apex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor closed class of graphs, hence by the deep results of Robertson and Seymour,…

Let $2\le k\in\mathbb{Z}$. A total coloring of a $k$-regular simple graph via $k+1$ colors is an {\it efficient total coloring} if each color yields an efficient dominating set, where the efficient domination condition applies to the…

Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to…

We prove that every graph has a spectral sparsifier with a number of edges linear in its number of vertices. As linear-sized spectral sparsifiers of complete graphs are expanders, our sparsifiers of arbitrary graphs can be viewed as…

In this paper we show lower bounds for a certain large class of algorithms solving the Graph Isomorphism problem, even on expander graph instances. Spielman [25] shows an algorithm for isomorphism of strongly regular expander graphs that…

We determine the minimum size of $n$-factor-critical graphs and that of $k$-extendable bipartite graphs, by considering Harary graphs and related graphs. Moreover, we determine the minimum size of $k$-extendable non-bipartite graphs for…

Most of the literature on spanners focuses on building the graph from scratch. This paper instead focuses on adding edges to improve an existing graph. A major open problem in this field is: given a graph embedded in a metric space, and a…

The 1-2-3 Conjecture, introduced by Karo\'nski, {\L}uczak, and Thomason in 2004, was recently solved by Keusch. This implies that, for any connected graph $G$ different from $K_2$, we can turn $G$ into a locally irregular multigraph $M(G)$,…

A $1$-factor in an $n$-vertex graph $G$ is a collection of $\frac{n}{2}$ vertex-disjoint edges and a $1$-factorization of $G$ is a partition of its edges into edge-disjoint $1$-factors. Clearly, a $1$-factorization of $G$ cannot exist…

In this paper we unify several existing regularity conditions for graphs, including strong regularity, $k$-isoregularity, and the $t$-vertex condition. We develop an algebraic composition/decomposition theory of regularity conditions. Using…

Graph spanners are sparse subgraphs that faithfully preserve the distances in the original graph up to small stretch. Spanner have been studied extensively as they have a wide range of applications ranging from distance oracles, labeling…

Recently, a construction of minimal codes arising from a family of almost Ramanujan graphs was shown. Ramanujan graphs are examples of expander graphs that minimize the second-largest eigenvalue of their adjacency matrix. We call such…

We devise an algorithm that approximately computes the number of paths of length $k$ in a given directed graph with $n$ vertices up to a multiplicative error of $1 \pm \varepsilon$. Our algorithm runs in time $\varepsilon^{-2} 4^k(n+m)…

There is a graph reduction system so that every optimal 1-planar graph can be reduced to an irreducible extended wheel graph, provided the reductions are applied such that the given graph class is preserved. A graph is optimal 1-planar if…

The graphs $D(k,q)$ have connected components $CD(k,q)$ giving the best known bounds on extremal problems with {\em forbidden\/} even cycles, and are denser than the well-known graphs of Lubotzky, Phillips, Sarnak and Margulis. Despite…

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. showed that there are maximal 1-planar graphs with only…

We prove that for sufficiently large k, there exist $0\le\sigma_k\le\eps_k\to 0$ as $k\to\infty$, such that asymptotically almost surely the first k-regular subgraph appeared in the random graph process where one edge is added at a time has…

We introduce a notion of a girth-regular graph as a $k$-regular graph for which there exists a non-descending sequence $(a_1, a_2, \dots, a_k)$ (called the signature) giving, for every vertex $u$ of the graph, the number of girth cycles the…

An $[a,b]$-factor of a graph $G$ is a spanning subgraph $H$ such that $a\leq d_{H}(v)\leq b$ for each $v\in V(G)$. In this paper, we provide spectral conditions for the existence of an odd $[1,b]$-factor in a connected graph with minimum…