Related papers: All bipartite circulants are dispersable
The interconnection network considered in this paper is the bubble-sort star graph. The $n$-dimensional bubble-sort star graph $BS_n$ is a bipartite and $(2n-3)$-regular graph of order $n!$. A bipartite graph $G$ is edge-bipancyclic if each…
We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particular, we prove that every regular hyperfinite bipartite graphing admits a measurable perfect matching if it is one-ended or the degree is odd.…
A natural extension of bipartite graphs are $d$-partite clutters, where $d \geq 2$ is an integer. For a poset $P$, Ene, Herzog and Mohammadi introduced the $d$-partite clutter $\mathcal{C}_{P,d}$ of multichains of length $d$ in $P$, showing…
We prove the existence of infinite classes of cyclic G-decompositions of the complete multipartite graph, G being a caterpillar, a hairy cycle or a cycle. All the results are obtained by the construction of d-divisible $\alpha$-labelings of…
We completely characterize triangulations of the projective plane that have a spanning bipartite quadrangulation subgraph. This is an affirmative answer to a question by K\"undgen and Ramamurthi (J Combin Theory Ser B 85, 307--337, 2002)…
A bipartite graph $H$ is said to have Sidorenko's property if the probability that the uniform random mapping from $V(H)$ to the vertex set of any graph $G$ is a homomorphism is at least the product over all edges in $H$ of the probability…
Extensive Monte Carlo simulations were carried out to investigate the nature of the ordering transition of a model of adsorbed self-assembled rigid rods on the bonds of a square lattice [Tavares et. al., Phys. Rev E 79, 021505 (2009)]. The…
Let $M$ be a connected, closed, orientable, irreducible $3$-manifold. We show that: if $M$ admits a co-orientable taut foliation $\mathcal{F}$ with orderable cataclysm, then $\pi_1(M)$ is left orderable. This provides an elementary proof…
In this article we prove a linear inviscid damping result with optimal decay rates of the 2D irrotational circulation flow around an elliptical cylinder. In our result, all components of the asymptotic velocity field do not vanish and the…
An $(s,t)$-matching in a bipartite graph $G=(U,V,E)$ is a subset of the edges $F$ such that each component of $G[F]$ is a tree with at most $t$ edges and each vertex in $U$ has $s$ neighbours in $G[H]$. We give sharp conditions for a…
A conjecture of Barnette states that every 3-connected cubic bipartite plane graph has a Hamilton cycle, which is equivalent to the statement that every simple even plane triangulation admits a partition of its vertex set into two subsets…
We study the algebraic structure of the mesonic moduli spaces of bipartite field theories by computing the Hilbert series. Bipartite field theories form a large family of 4d N=1 supersymmetric gauge theories that are defined by bipartite…
The Foldy-Lax equation is generalized for a medium which consists of particles with both electric and magnetic responses. The result is used to compute fields scattered from ensembles of particles. The computational complexity is reduced by…
Ore proved that a finite group is cyclic if and only if its subgroup lattice is distributive. Now, since every subgroup of a cyclic group is normal, we call a subfactor planar algebra cyclic if all its biprojections are normal and form a…
In this paper, we generalize Chow-Luo's combinatorial Ricci flow to inversive distance circle packing setting. Although the solution to the generalized flow may develop singularities in finite time, we can always extend the solution so as…
We introduce a notion of {\em cyclic Schur-positivity} for sets of permutations, which naturally extends the classical notion of Schur-positivity, and it involves the existence of a bijection from permutations to standard Young tableaux…
Using the theory of combinatorial species, we compute the cycle index for bipartite graphs, which we use to count unlabeled bipartite graphs and bipartite blocks.
We show that, for every linear ordering of $[2]^n$, there is a large subcube on which the ordering is lexicographic. We use this to deduce that every long sequence contains a long monotone subsequence supported on an affine cube. More…
We consider the systems of diffusion-orthogonal polynomials, defined in the work [1] of D. Bakry, S. Orevkov and M. Zani and (particularly) explain why these systems with boundary of maximal possible degree should always come from the…
We investigate bipartite entanglement and prove that in constrained energy subspaces, the entanglement spectra of multiple bipartitions are the same across the whole subspace. We show that in quantum many-body systems the bipartite…