Related papers: Intrinsically linked graphs and even linking numbe…
The purpose of this paper is to characterize graphs that do not have a large $K_{2,n}$-minor. As corollaries, it is proved that, for any given positive integer $n$, every sufficiently large 3-connected graph with minimum degree at least…
A spectral characterization of the matching number (the size of a maximum matching) of a graph is given. More precisely, it is shown that the graphs G of order n whose matching number is k are precisely those graphs with the maximum skew…
A $k$-container $C(u, v)$ of a graph $G$ is a set of $k$ internally disjoint paths between $u$ and $v$. A $k$-container $C(u, v)$ of $G$ is a $k^*$-container if it is a spanning subgraph of $G$. A graph $G$ is $k^*$-connected if there…
We prove that if $H$ is a subgraph of a complete multipartite graph $G$, then $H$ contains a connected component $H'$ satisfying $|E(H')||E(G)|\geq |E(H)|^2$. We use this to prove that every three-coloring of the edges of a complete graph…
The adjacency matrices of graphs form a special subset of the set of all integer symmetric matrices. The description of which graphs have all their eigenvalues in the interval [-2,2] (i.e., those having spectral radius at most 2) has been…
For graphs $F$ and $H$, let $i(F)$ denote the inducibility of $F$ and let $i_H(F)$ denote the inducibility of $F$ over $H$-free graphs. We prove that for almost all graphs $F$ on a given number of vertices, $i_{K_k}(F)$ attains infinitely…
Graph is an important data representation ubiquitously existing in the real world. However, analyzing the graph data is computationally difficult due to its non-Euclidean nature. Graph embedding is a powerful tool to solve the graph…
We investigate quantum and nonsignaling generalizations of perfect matchings in graphs using nonlocal games. Specifically, we introduce nonlocal games that test for $L$-perfect matchings in bipartite graphs, perfect matchings in general…
Let $G=(V,E)$ be a finite, connected graph. We consider a greedy selection of vertices: given a list of vertices $x_1, \dots, x_k$, take $x_{k+1}$ to be any vertex maximizing the sum of distances to the existing vertices and iterate: we…
We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…
We show that for any simple non-oriented graph G with at least thirteen vertices either G or its complement is intrinsically linked.
We consider the problem of how much edge connectivity is necessary to force a graph G to contain a fixed graph H as an immersion. We show that if the maximum degree in H is D, then all the examples of D-edge connected graphs which do not…
Rigidity, arising in discrete geometry, is the property of a structure that does not flex. Laman provides a combinatorial characterization of rigid graphs in the Euclidean plane, and thus rigid graphs in the Euclidean plane have…
A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if…
We consider problems of finding a maximum size/weight $t$-matching without forbidden subgraphs in an undirected graph $G$ with the maximum degree bounded by $t+1$, where $t$ is an integer greater than $2$. Depending on the variant forbidden…
Let $G$ be a connected graph with vertex set $V(G)=\{v_1,v_2,...,v_{\nu}\}$, which may have multiple edges but have no loops, and $2\leq d_G(v_i)\leq 3$ for $i=1,2,...,\nu$, where $d_G(v)$ denotes the degree of vertex $v$ of $G$. We show…
Lettericity is a graph parameter responsible for many attractive structural properties. In particular, graphs of bounded lettericity have bounded linear clique-width and they are well-quasi-ordered by induced subgraphs. The latter property…
A graph is Berge if it has no induced odd cycle on at least 5 vertices and no complement of induced odd cycle on at least 5 vertices. A graph is perfect if the chromatic number equals the maximum clique number for every induced subgraph.…
Let $G$ be a graph of order $n$. The path decomposition of $G$ is a set of disjoint paths, say $\mathcal{P}$, which cover all vertices of $G$. If all paths are induced paths in $G$, then we say $\mathcal{P}$ is an induced path decomposition…
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…