Related papers: Nucleation-free independent graphs with implied no…
We analyze the Brill-Noether theory of trivalent graphs and multigraphs having largest possible automorphism group in a fixed genus. For trivalent multigraphs with loops of genus at least 3, we show that there exists a graph with maximal…
We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that a colored graph lacks colorful cycles iff it is Gallai, i.e.,…
The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture…
An ILD-set in a connected graph is a subset $S$ of vertices such that it is both independent and locating-dominating. The independent locating-dominating number of a graph G is the minimum cardinality of an ILD-set set of $G$. A well-known…
We consider two types of matroids defined on the edge set of a graph $G$: count matroids ${\cal M}_{k,\ell}(G)$, in which independence is defined by a sparsity count involving the parameters $k$ and $\ell$, and the (three-dimensional…
A graph $U$ is an induced universal graph for a family $F$ of graphs if every graph in $F$ is a vertex-induced subgraph of $U$. For the family of all undirected graphs on $n$ vertices Alstrup, Kaplan, Thorup, and Zwick [STOC 2015] give an…
For unweighted graphs, finding isometric embeddings is closely related to decompositions of $G$ into Cartesian products of smaller graphs. When $G$ is isomorphic to a Cartesian graph product, we call the factors of this product a…
The avoidance of induced forests, or induced acyclic subgraphs, in $d$-dimensional grid graphs, or lattice graphs, has been studied in Alon et al. and later in Caragiannis et al., finding upper and lower bounds with respect to the number of…
One of the major problems in combinatorics is to determine the number of $r$-uniform hypergraphs ($r$-graphs) on $n$ vertices which are free of certain forbidden structures. This problem dates back to the work of Erd\H{o}s, Kleitman and…
We describe an infinite family of graphs $G_n$, where $G_n$ has $n$ vertices, independence number at least $n/4$, and no set of less than $\sqrt{n}/2$ vertices intersects all its maximum independent sets. This is motivated by a question of…
This paper gives a precise structure theorem for the class of graphs which do not contain $W_4$ as an immersion. This strengthens a previous result of Belmonte at al. that gives a rough description of this class. In fact, we prove a…
A nut graph is a nontrivial simple graph whose adjacency matrix contains a one-dimensional null space spanned by a vector without zero entries. Moreover, an $\ell$-circulant graph is a graph that admits a cyclic group of automorphisms…
An \emph{s-graph} is a graph with two kinds of edges: \emph{subdivisible} edges and \emph{real} edges. A \emph{realisation} of an s-graph $B$ is any graph obtained by subdividing subdivisible edges of $B$ into paths of arbitrary length (at…
We establish the following splitter theorem for graphs and its generalization for matroids: Let $G$ and $H$ be $3$-connected simple graphs such that $G$ has an $H$-minor and $k:=|V(G)|-|V(H)|\ge 2$. Let $n:=\left\lceil k/2\right\rceil+1$.…
Rigid frameworks in some Euclidian space are embedded graphs having a unique local realization (up to Euclidian motions) for the given edge lengths, although globally they may have several. We study the number of distinct planar embeddings…
In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erd\H{o}s-R\'{e}nyi model or the Barab\'{a}si-Albert model. Unfortunately, most graph generating…
A graph $G = (V,E)$ is globally rigid in $\mathbb{R}^d$ if for any generic placement $p : V \rightarrow \mathbb{R}^d$ of the vertices, the edge lengths $||p(u) - p(v)||, uv \in E$ uniquely determine $p$, up to congruence. In this paper we…
A conjecture of Graver from 1991 states that the generic $3$-dimensional rigidity matroid is the unique maximal abstract $3$-rigidity matroid with respect to the weak order on matroids. Based on a close similarity between the generic…
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.