相关论文: Subfactors of index less than 5, part 1: the princ…

In a nutshell, submodular functions encode an intuitive notion of diminishing returns. As a result, submodularity appears in many important machine learning tasks such as feature selection and data summarization. Although there has been a…

Given a graph $H$, a graph $G$ is called $H$-critical if $G$ does not admit a homomorphism to $H$, but any proper subgraph of $G$ does. Observe that $K_{k-1}$-critical graphs are the standard $k$-(colour)-critical graphs. We consider…

Let $H$ be a fixed graph and $\mathcal{G}$ a subcritical graph class. In this paper we show that the number of occurrences of $H$ (as a subgraph) in a uniformly at random graph of size $n$ in $\mathcal{G}$ follows a normal limiting…

A 1-factor of a hypergraph $G=(X,W)$ is a set of hyperedges such that every vertex of $G$ is incident to exactly one hyperedge from the set. A 1-factorization is a partition of all hyperedges of $G$ into disjoint 1-factors. The adjacency…

Let m and r be two integers. Let G be a connected r-regular graph of order n and k an integer depending on m and r. For even kn, we find a best upper bound (in terms of r and m) on the third largest eigenvalue that is sufficient to…

A graph is called hypohamiltonian if it is not hamiltonian but becomes hamiltonian if any vertex is removed. Many hypohamiltonian planar cubic graphs have been found, starting with constructions of Thomassen in 1981. However, all the…

A connected 1-factorisation is a 1-factorisation of a hypergraph for which the union of each pair of distinct 1-factors is a connected hypergraph. A uniform 1-factorisation is a 1-factorisation of a hypergraph for which the union of each…

A (3,4)-biregular bigraph G is a bipartite graph where all vertices in one part have degree 3 and all vertices in the other part have degree 4. A path factor of G is a spanning subgraph whose components are nontrivial paths. We prove that a…

Let $\Gamma$ be a chart. For each label $m$, we denote by $\Gamma_m$ the "subgraph" of $\Gamma$ consisting of all the edges of label $m$ and their vertices. Let $\Gamma$ be a minimal chart of type $(m;3,3)$. That is, a minimal chart…

Erd\H{o}s, Harary, and Tutte defined the dimension of a graph $G$ as the smallest natural number $n$ such that $G$ can be embedded in $\mathbb{R}^n$ with each edge a straight line segment of length 1. Since the proposal of this definition,…

A factor of a graph is a spanning subgraph satisfying some given conditions. An earlier survey of factors can be traced back to the Akiyama and Kano [J. Graph Theory, 1985, 9: 1-42] in which they described the characterization of factors in…

The Galois group of the minimal polymonal of a Jones index value gives a new type of obstruction to a principal graph, thanks to a recent result of P.Etingof, D.Nikshych, and V.Ostrik. We show that the sequence of the graphs given by…

In this paper, we show the following two theorems (here $c_{i}(G-X)$ is the number of components $C$ of $G-X$ with $|V(C)|=i$): (i)~If a graph $G$ satisfies $c_{1}(G-X)+\frac{1}{3}c_{3}(G-X)+\frac{1}{3}c_{5}(G-X)\leq \frac{2}{3}|X|$ for all…

A problem proposed by Erd\H{o}s, Fajtlowicz and Staton asks for the smallest $n$ for which every graph on $n$ vertices contains a regular induced subgraph of order at least $k$. A variation is to ask for a regular induced subgraph of order…

An interval graph is considered improper if and only if it has a representation such that an interval contains another interval. Previously these have been investigated in terms of balance and minimal forbidden interval subgraphs for the…

Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…

In 1976, Cameron, Goethals, Seidel, and Shult classified all the graphs whose smallest eigenvalue is at least $-2$ by relating such graphs to root systems that appear in the classification of semisimple Lie algebras. In this paper,…

In descending generality I survey: five partial orderings of graphs, the induced-subgraph ordering, and examples like perfect, threshold, and mock threshold graphs. The emphasis is on how the induced subgraph ordering differs from other…

A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\lambda_{\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower…

We describe normal forms and minimal models of Picard curves, discussing various arithmetic aspects of these. We determine all so-called special Picard curves over $\mathbb{Q}$ with good reduction outside 2 and 3, and use this to determine…