Related papers: Almost all cancellative triple systems are tripart…
We prove that, if $\Gamma$ is a finite connected $3$-valent vertex-transitive, or $4$-valent vertex- and edge-transitive graph, then either $\Gamma$ is part of a well-understood family of graphs, or every non-identity automorphism of…
For every positive integer $t$ we construct a finite family of triple systems ${\mathcal M}_t$, determine its Tur\'{a}n number, and show that there are $t$ extremal ${\mathcal M}_t$-free configurations that are far from each other in…
We prove that, given a finite graph $\Sigma$ satisfying some mild conditions, there exist infinitely many tetravalent half-arc-transitive normal covers of $\Sigma$. Applying this result, we establish the existence of infinite families of…
Every graph is majority 3-choosable. This generalises the result by Shelah-Milner that every graph has an unfriendly 3-partition, confirming a conjecture of Haslegrave from 2020.
We prove that for any integers $p\geq k\geq 3$ and any $k$-tuple of positive integers $(n_1,\ldots ,n_k)$ such that $p=\sum _{i=1}^k{n_i}$ and $n_1\geq n_2\geq \ldots \geq n_k$, the condition $n_1\leq {p\over 2}$ is necessary and sufficient…
The determination of genuine entanglement is a central problem in quantum information processing. We investigate the tripartite state as the tensor product of two bipartite entangled states by merging two systems. We show that the…
We discuss the subject of Unextendible Product Bases with the orthogonality condition dropped and we prove that the lowest rank non-separable positive-partial-transpose states, i.e. states of rank 4 in 3 x 3 systems are always locally…
A connected graph G is 3-flow-critical if G does not have a nowhere-zero 3-flow, but every proper contraction of G does. We prove that every n-vertex 3-flow-critical graph other than K_2 and K_4 has at least 5n/3 edges. This bound is tight…
We prove a structure theorem for non-isomorphic endomorphisms of weak Q-Fano threefolds, or more generally for threefolds with big anti-canonical divisor. Also provided is a criterion for a fibred rationally connected threefold to be…
We show the existence of a family of manifolds on which all (pointwise or absolutely) partially hyperbolic systems are dynamically coherent. This family is the set of 3-manifolds with nilpotent, non-abelian fundamental group. We further…
A family of sets $\mathcal{A}$ is union-closed if it is finite and nonempty with member sets that are all finite and distinct (at least one of which is nonempty) and it satisfies the property $X, Y \in \mathcal{A} \implies X \cup Y \in…
The dynamics of tripartite entanglement of fermionic system in noninertial frames through linear contraction criterion when one or two observers are accelerated is investigated. In one observer accelerated case the entanglement measurement…
Let End(V) denote the ring of all linear transformations of an arbitrary k-vector space V over a field k. We define a subset X of End(V) to be "triangularizable" if V has a well-ordered basis such that X sends each vector in that basis to…
An edge $e$ of a matching covered graph $G$ is removable if $G-e$ is also matching covered. The notion of removable edge arises in connection with ear decompositions of matching covered graphs introduced by Lov\'asz and Plummer. A…
The celebrated Mantel's theorem states that any triangle-free graph on $n$ vertices contains at most $\left\lfloor n^2/4\right\rfloor$ edges. It is natural to ask how many triangles must exist in a graph with more than $\left\lfloor…
We establish an upper bound on the minimum codegree necessary for the existence of spanning, fractional Steiner triple systems in $3$-uniform hypergraphs. This improves upon a result by Lee in 2023. In particular, together with results from…
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…
The complete reducibility property for bipartite states reduced the separability problem to a proper subset of positive under partial transpose states and was used to prove several theorems inside and outside entanglement theory. So far…
We give a simple proof of a result originally due to Dimca and Suciu: a group that is both Kaehler and the fundamental group of a closed three-manifold is finite. We also prove that a group that is both the fundamental group of a closed…
The colouring defect of a cubic graph is the smallest number of edges left uncovered by any set of three perfect matchings. While $3$-edge-colourable graphs have defect $0$, those that cannot be $3$-edge-coloured (that is, snarks) are known…