Related papers: Invariant covers of multipartite hypergraphs
We discuss conjectures on Hamiltonicity in cubic graphs (Tait, Barnette, Tutte), on the dichromatic number of planar oriented graphs (Neumann-Lara), and on even graphs in digraphs whose contraction is strongly connected (Hochst\"attler). We…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
Recently, connections have been explored between the complexity of finite problems in graph theory and the complexity of their infinite counterparts. As is shown in our paper (and in independent work of Tirza Hirst and D. Harel from a…
We focus on two specific generalizations of the chromatic symmetric function: one involving universal graphs and the other concerning vertex-weighted graphs. In this paper, we introduce a unified generalization that incorporates both…
Let $S$ be a surface with a metric $d$ satisfying an upper curvature bound in the sense of Alexandrov (i.e. via triangle comparison). We show that an almost conformal harmonic map from a surface into $(S,d)$ is a branched covering. As a…
The Lagrangian density of an $r$-uniform hypergraph $H$ is $r!$ multiplying the supremum of the Lagrangians of all $H$-free $r$-uniform hypergraphs. For an $r$-uniform graph $H$ with $t$ vertices, it is clear that $\pi_{\lambda}(H)\ge…
Given a graph $G$ and a subset $X$ of vertices of $G$ with size at least two, we denote by $N^2_G(X)$ the set of vertices of $G$ that have at least two neighbors in $X$. We say that a bipartite graph $G$ with sides $A$ and $B$ satisfies the…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
We study the relation between $J$-anti-invariant $2$-forms and pseudoholomorphic curves in this paper. We show the zero set of a closed $J$-anti-invariant $2$-form on an almost complex $4$-manifold supports a $J$-holomorphic subvariety in…
We show that the edges of every 3-connected planar graph except $K_4$ can be colored with two colors in such a way that the graph has no color preserving automorphisms. Also, we characterize all graphs which have the property that their…
This paper characterises the subspaces of $H^2(\mathbb D)$ simultaneously invariant under $S^2 $ and $S^{2k+1}$, where $S$ is the unilateral shift, then further identifies the subspaces that are nearly invariant under both $(S^2)^*$ and…
In 1987, Kolaitis, Pr\"omel and Rothschild proved that, for every fixed $r \in \mathbb{N}$, almost every $n$-vertex $K_{r+1}$-free graph is $r$-partite. In this paper we extend this result to all functions $r = r(n)$ with $r \leqslant (\log…
We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one,…
Link homotopy has been an active area of research for knot theorists since its introduction by Milnor in the 1950s. We introduce a new equivalence relation on spatial graphs called component homotopy, which reduces to link homotopy in the…
We prove that for all $r\geq2$ and c>0, every graph of order n with at least cn^{r} cliques of order r contains a complete r-partite graph with each part of size $\lfloor c^{r}\log n \rfloor.$ This result implies a concise form of the…
We give conditions on the Lee vector field of an almost Hermitian manifold such that any holomorphic map from this manifold into a (1,2)-symplectic manifold must satisfy the fourth-order condition of being biharmonic, hence generalizing the…
We show that, given an infinite cardinal $\mu$, a graph has colouring number at most $\mu$ if and only if it contains neither of two types of subgraph. We also show that every graph with infinite colouring number has a well-ordering of its…
We say that an edge colouring $c$ of a graph preserves an automorphism $\varphi$ if $\varphi$ maps each edge to an edge of the same colour. Otherwise, we say that $c$ breaks $\varphi$. We call an automorphism of a graph small if it moves…
A graph $H$ is common if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is asymptotically minimised by the random colouring. We prove that, given $k,r>0$, there exists a $k$-connected common…
Aperture synthesis observations with full polarisation have long been used to study the magnetic fields of synchrotron emitting sources. Recently proposed closure invariants give us a powerful method for extracting information from measured…