Related papers: Resolvable h-sun designs

A $k$-uniform hypergraph $M$ is set-homogeneous if it is countable (possibly finite) and whenever two finite induced subhypergraphs $U,V$ are isomorphic there is $g\in Aut(M)$ with $U^g=V$; the hypergraph $M$ is said to be homogeneous if in…

We determine how large r-partite graphs can be found in r-uniform graphs with n vertices and Cn^r edges, where C is a slowly decreasing function of n. This refines results of Erdos from 1964.

Given a finite simple undirected graph $G$, let $T_1(G)$ denote the subset of vertices of $G$ such that every vertex of $T_1(G)$ belongs to at least one subgraph isomorphic to a graph obtained by connecting a single vertex to two vertices…

This paper considers a kind of generalized measure $\kappa_s^{(h)}$ of fault tolerance in the $(n,k)$-star graph $S_{n,k}$ and determines $\kappa_s^{(h)}(S_{n,k})=n+h(k-2)-1$ for $2 \leqslant k \leqslant n-1$ and $0\leqslant h \leqslant…

Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…

We prove a formula for the geometric genus of splice-quotient singularities (in the sense of Neumann and Wahl). This formula enables us to compute the invariant from the resolution graph; in fact, it reduces the computation to that for…

We apply our new approach of quantum Separation of Variables (SoV) to the complete characterization of the transfer matrix spectrum of quantum integrable lattice models associated to gl(n)-invariant R-matrices in the fundamental…

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…

Let P^2_r be the projective plane blown up at r generic points. Denote by E_0,E_1,...,E_r the strict transform of a generic straight line on P^2 and the exceptional divisors of the blown-up points on P^2_r respectively. We consider the…

We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…

Let $\mathcal S\to\mathbb A^1$ be a smooth family of surfaces whose general fibre is a smooth surface of $\mathbb P^3$ and whose special fibre has two smooth components, intersecting transversally along a smooth curve $R$. We consider the…

Let $Z$ be a projective hypersurface such that its underlying reduced variety has only isolated singularities. In case its irreducible components have constant multiplicities, for instance if $\dim Z>1$, we show that the spectrum of its…

In this article we give an explicit classification for the countably infinite graphs $\mathcal{G}$ which are, for some $k$, $\geq$$ k$-homogeneous. It turns out that a $\geq$$k-$homogeneous graph $\mathcal{M}$ is non-homogeneous if and only…

The search for a highly discriminating and easily computable invariant to distinguish graphs remains a challenging research topic. Here we focus on cospectral graphs whose complements are also cospectral (generalized cospectral), and on…

We look at colourings of $r$-uniform hypergraphs, focusing our attention on unique colourability and gaps in the chromatic spectrum. The pattern of an edge $E$ in an $r$-uniform hypergraph $H$ whose vertices are coloured is the partition of…

Given two graphs G and H, there is a bi-resolving (or bi-covering) graph homomorphism from G to H if and only if their adjacency matrices satisfy certain matrix relations. We investigate the bi-covering extensions of bi-resolving…

We solve the existence problem for $F$-designs for arbitrary $r$-uniform hypergraphs~$F$. This implies that given any $r$-uniform hypergraph~$F$, the trivially necessary divisibility conditions are sufficient to guarantee a decomposition of…

We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.

The $k$-core decomposition is a widely studied summary statistic that describes a graph's global connectivity structure. In this paper, we move beyond using $k$-core decomposition as a tool to summarize a graph and propose using $k$-core…

A complete group classification of a class of variable coefficient (1+1)-dimensional telegraph equations $f(x)u_{tt}=(H(u)u_x)_x+K(u)u_x$, is given, by using a compatibility method and additional equivalence transformations. A number of new…