相关论文: On fat Hoffman graphs with smallest eigenvalue at …

For a hereditary family of graphs $\FF$, let $\FF_n$ denote the set of all members of $\FF$ on $n$ vertices. The speed of $\FF$ is the function $f(n)=|\FF_n|$. An implicit representation of size $\ell(n)$ for $\FF_n$ is a function assigning…

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

We establish new results on the weak containment of quasi-regular and Koopman representations of a second countable locally compact group $G$ associated with non-singular $G$-spaces. We deduce that any two boundary representations of a…

Let $\{F_n, n\ge 8\}$ be a family of diffeomorphisms on real rational surfaces that are birationally equivalent to birational maps on $\mathbf{P}^2(\mathbb{R})$. In this article, we investigate the mapping classes of the diffeomorphisms…

Robertson and Seymour proved that for every finite tree $H$, there exists $k$ such that every finite graph $G$ with no $H$ minor has path-width at most $k$; and conversely, for every integer $k$, there is a finite tree $H$ such that every…

The Hoffman program with respect to any real or complex square matrix $M$ associated to a graph $G$ stems from A. J. Hoffman's pioneering work on the limit points for the spectral radius of adjacency matrices of graphs less than…

We derive upper bounds for the eigenvalues of the Kirchhoff Laplacian on a compact metric graph depending on the graph's genus g. These bounds can be further improved if $g = 0$, i.e. if the metric graph is planar. Our results are based on…

Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…

Let $G$ be a simple connected graph with $n\geq 5$ vertices. In this note, we will prove that $s_3(G)\leq n$, and characterize the graphs which satisfy that $s_3(G)=n, n-1, n-2, $ or $n-3$, where $s_3(G)$ is the third invariant factor of…

The prime graph of a finite group $G$ is denoted by $\ga(G)$. Also $G$ is called recognizable by prime graph if and only if each finite group $H$ with $\ga(H)=\ga(G)$, is isomorphic to $G$. In this paper, we classify all finite groups with…

A new model, in terms of finite bipartite graphs, of the free pseudosemilattice is presented. This will then be used to obtain several results about the variety SPS of all strict pseudosemilattices: (i) an identity basis for SPS is found,…

We parameterize the finite-dimensional irreducible representations of a class of pointed Hopf algebras over an algebraically closed field of characteristic zero by dominant characters. The Hopf algebras we are considering arise in the work…

A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained…

In this paper we study asymptotically hyperbolic manifolds given as graphs of asymptotically constant functions over hyperbolic space $\bH^n$. The graphs are considered as subsets of $\bH^{n+1}$ and carry the induced metric. For such…

For a positive integer $k$ and a graph $H$ on $k$ vertices, we are interested in the inducibility of $H$, denoted $\mathrm{ind}(H)$, which is defined as the maximum possible probability that choosing $k$ vertices uniformly at random from a…

Given a hypergraph $H$, the size-Ramsey number $\hat{r}_2(H)$ is the smallest integer $m$ such that there exists a graph $G$ with $m$ edges with the property that in any colouring of the edges of $G$ with two colours there is a…

We prove that if $\Sigma$ is a closed surface of genus at least 3 and $G$ is a split real semisimple Lie group of rank at least $3$ acting faithfully by isometries on a symmetric space $N$, then there exists a Hitchin representation…

We show that for all graphs H of size n, the complete graph $K_{2n+1}$ has an $H$-decomposition.

It is shown that graphs that generalize the ADE Dynkin diagrams and have appeared in various contexts of two-dimensional field theory may be regarded in a natural way as encoding the geometry of a root system. After recalling what are the…

The smallest set Q of vertices of a graph G, such that every path on 3 vertices, has at least one vertex in Q, is a minimum 3-covering of G. By attaching loops of weight 1 to the vertices of G we can find the eigenvalues associated with G,…