Results 31 to 40 of about 55,995 (279)
Front representation of set partitions
, 2011 Let $\pi$ be a set partition of $[n]=\{1,2,...,n\}$. The standard representation of $\pi$ is the graph on the vertex set $[n]$ whose edges are the pairs $(i,j)$ of integers with ...
Kim, Jang Soo
core +1 more source
The B-Domatic Number of a Graph
Discussiones Mathematicae Graph Theory, 2013 Besides the classical chromatic and achromatic numbers of a graph related to minimum or minimal vertex partitions into independent sets, the b-chromatic number was introduced in 1998 thanks to an alternative definition of the minimality of such ...
Favaron Odile
doaj +1 more source
AGT, N-Burge partitions and W_N minimal models [PDF]
, 2015 Let ${\mathcal B}^{\, p, \, p^{\prime}, \, {\mathcal H}}_{N, n}$ be a conformal block, with $n$ consecutive channels $\chi_{\i}$, $\i = 1, \cdots, n$, in the conformal field theory $\mathcal{M}^{\, p, \, p^{\prime}}_N \! \times \! \mathcal{M}^{\mathcal{H}
Belavin, Vladimir +2 more
core +4 more sources
Embedding the dual complex of hyper-rectangular partitions
Journal of Computational Geometry, 2013 A rectangular partition is the partition of an (axis-aligned) rectangle into interior-disjoint rectangles. We ask whether a rectangular partition permits a nice drawing of its dual, that is, a straight-line embedding of it such that each dual vertex is ...
Michael Kerber
doaj +1 more source
Trace Identities for the Topological Vertex
, 2017 The topological vertex is a universal series which can be regarded as an object in combinatorics, representation theory, geometry, or physics. It encodes the combinatorics of 3D partitions, the action of vertex operators on Fock space, the Donaldson ...
Bryan, Jim +2 more
core +1 more source
Vertex partition problems in digraphs
Anais do III Encontro de Teoria da Computação (ETC 2018), 2018 Let D be a digraph and k be a positive integer. Linial (1981) conjec tured that the k-norm of a k-minimum path partition of a digraph D is at most max{ΣC∈C |C| : C is a partial k-coloring of D}. Berge (1982) conjectured that every k-minimum path partition contains a partial k-coloring orthogonal to it.
M. Sambinelli +3 more
openaire +2 more sources
On the b-Domatic Number of Graphs
Discussiones Mathematicae Graph Theory, 2019 A set of vertices S in a graph G = (V, E) is a dominating set if every vertex not in S is adjacent to at least one vertex in S. A domatic partition of graph G is a partition of its vertex-set V into dominating sets. A domatic partition 𝒫 of G is called b-
Benatallah Mohammed +2 more
doaj +1 more source
Three types of dual Grothendieck universal characters and integrable systems
Nuclear Physics BWe construct vertex operator realizations of the π-type dual Grothendieck universal characters with partitions π=(3),π=(2,1) and π=(13). Furthermore, these three types of dual Grothendieck universal characters are extended to their multiparameter ...
Jinzhou Liu, Denghui Li, Zhaowen Yan
doaj +1 more source
Universal and Near-Universal Cycles of Set Partitions [PDF]
, 2015 We study universal cycles of the set ${\cal P}(n,k)$ of $k$-partitions of the set $[n]:=\{1,2,\ldots,n\}$ and prove that the transition digraph associated with ${\cal P}(n,k)$ is Eulerian. But this does not imply that universal cycles (or ucycles) exist,
Godbole, Anant +3 more
core +1 more source
Perfect 3-colorings of the cubic graphs of order 10
Electronic Journal of Graph Theory and Applications, 2017 Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect m-coloring of a graph G with m colors is a partition of the vertex set of G into m parts A_1, A_2, ..., A_m such that, for all $ i,j \in \lbrace ...
Mehdi Alaeiyan, Ayoob Mehrabani
doaj +1 more source