Related papers: On Kernel Mengerian Orientations of Line Multigrap…

Let k >= 2 and F be a linear k-uniform hypergraph with v vertices. We prove that if n is sufficiently large and v|n, then every quasirandom k-uniform hypergraph on n vertices with constant edge density and minimum degree $\Omega(n^{k-1})$…

In this paper we introduce a superclass of split digraphs, which we call spine digraphs. Those are the digraphs D whose vertex set can be partitioned into two sets X and Y such that the subdigraph induced by X is traceable and Y is a stable…

Many real world graphs, such as the graphs of molecules, exhibit structure at multiple different scales, but most existing kernels between graphs are either purely local or purely global in character. In contrast, by building a hierarchy of…

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…

Let $G$ be a simple graph on $d$ vertices. We define a monomial ideal $K$ in the Stanley-Reisner ring $A$ of the order complex of the Boolean algebra on $d$ atoms. The monomials in $K$ are in one-to-one correspondence with the proper…

A graph $G$ is called \emph{symmetric with respect to a functional $F_G(P)$} defined on the set of all the probability distributions on its vertex set if the distribution $P^*$ maximizing $F_G(P)$ is uniform on $V(G)$. Using the…

The determinant method of Kasteleyn gives a method of computing the number of perfect matchings of a planar bipartite graph. In addition, results of Bernardi exhibit a bijection between spanning trees of a planar bipartite graph and…

A perfect matching in a graph $G$ is a set of nonadjacent edges covering every vertex of $G$. Motivated by recent progress on the relations between the eigenvalues and the matching number of a graph, in this paper, we aim to present a…

Multiple kernel learning (MKL) method is generally believed to perform better than single kernel method. However, some empirical studies show that this is not always true: the combination of multiple kernels may even yield an even worse…

A metric space $(X,d)$ is called a $subline$ if every 3-element subset $T$ of $X$ can be written as $T=\{x,y,z\}$ for some points $x,y,z$ such that $d(x,z)=d(x,y)+d(y,z)$. By a classical result of Menger, every subline of cardinality $\ne…

The dichromatic number of a digraph is the minimum integer $k$ such that it admits a $k$-dicolouring, i.e. a partition of its vertices into $k$ acyclic subdigraphs. We say that a digraph $D$ is a super-orientation of an undirected graph $G$…

Given a graph $G$, we say that an orientation $D$ of $G$ is a KT orientation if, for all $u, v \in V(D)$, there is at most one directed path (in any direction) between $u$ and $v$. Graphs that admit such orientations have been used by…

Let $D=(V,A)$ be a digraph and consider an arc subset $A'\subseteq A$ and an exhaustive mapping $\phi: A\to A'$ such that $(i)$ the set of heads of $A'$ is $H(A')=V$; $(ii)$ the map fixes the elements of $A'$, that is, $\phi|A'=Id$, and for…

A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least 5 or the complement of one.…

We provide a characterization for the continuous positive definite kernels on $\mathbb R^d$ that are invariant to linear isometries, i.e. invariant under the orthogonal group $O(d)$. Furthermore, we provide necessary and sufficient…

Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…

We complete the program of Ref. [3,5] of connecting totally non-negative Grassmannians to the reality problem in KP finite-gap theory via the assignment of real regular divisors on rational degenerations of M-curves for the class of real…

In the NP-hard Edge Dominating Set problem (EDS) we are given a graph $G=(V,E)$ and an integer $k$, and need to determine whether there is a set $F\subseteq E$ of at most $k$ edges that are incident with all (other) edges of $G$. It is…

Given a 2-edge-coloring $f : E(K_n) \rightarrow \{\pm 1\}$, the discrepancy of a subgraph $F \subseteq K_n$ is defined as $\left| \sum_{e \in E(F)} f(e) \right|$. Erd\H{o}s, F\"uredi, Loebl and S\'os showed that if $F$ is an $n$-vertex tree…

We study a Fourier-Mukai kernel associated to a GIT wall-crossing for arbitrarily singular (not necessarily reduced or irreducible) affine varieties over any field. This kernel is closely related to a derived fiber product diagram for the…