Results 21 to 30 of about 24,599 (177)
Star-path and star-stripe bipartite Ramsey numbers in multicoloring [PDF]
Transactions on Combinatorics, 2015 For given bipartite graphs G 1 ,G 2 ,…,G t , the bipartite Ramsey number bR(G 1 ,G 2 ,…,G t ) is the smallest integer n such that if the edges of the complete bipartite graph K n,n are partitioned into t disjoint color classes giving t ...
Ghaffar Raeisi
doaj
On interval number in cycle convexity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they ...
Julio Araujo +3 more
doaj +1 more source
A Constructive Extension of the Characterization on Potentially Ks,t-Bigraphic Pairs
Discussiones Mathematicae Graph Theory, 2017 Let Ks,t be the complete bipartite graph with partite sets of size s and t. Let L1 = ([a1, b1], . . . , [am, bm]) and L2 = ([c1, d1], . . . , [cn, dn]) be two sequences of intervals consisting of nonnegative integers with a1 ≥ a2 ≥ . . . ≥ am and c1 ≥ c2
Guo Ji-Yun, Yin Jian-Hua
doaj +1 more source
Decomposition of product graphs into complete bipartite subgraphs
Discrete Mathematics, 1985 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reznick, Bruce +2 more
openaire +2 more sources
A heuristic method for bi-decomposition of partial Boolean functions
Informatika, 2020 The problem of decomposition of a Boolean function is to represent a given Boolean function in the form of a superposition of some Boolean functions whose number of arguments are less than the number of given function.
Yu. V. Pottosin
doaj +1 more source
The triangle-free graphs with rank 6 [PDF]
, 2013 The rank of a graph G is defined to be the rank of its adjacency matrix A(G).
Fan, Yi-Zheng, Wang, Long, Wang, Yi
core +1 more source
Solutions to problems about potentially Ks,t-bigraphic pair
Open Mathematics, 2022 Let S=(a1,…,am;b1,…,bn)S=\left({a}_{1},\ldots ,{a}_{m};\hspace{0.33em}{b}_{1},\ldots ,{b}_{n}), where a1,…,am{a}_{1},\ldots ,{a}_{m} and b1,…,bn{b}_{1},\ldots ,{b}_{n} are two nonincreasing sequences of nonnegative integers. The pair S=(a1,…,am;b1,…,bn)S=
Yin Jian-Hua, Zhang Liang
doaj +1 more source
Complete subgraphs of bipartite graphs and applications to trace languages [PDF]
RAIRO - Theoretical Informatics and Applications, 1990 Summary: Motivated by a concurrency problem, a lattice describing a certain concurrent behaviour is constructed, whose elements are complete subgraphs of a bipartite graph. As an application of this construction, one derives, extending a result of Cori and Perrin, an explicit computation for the product of trace languages.
Guaiana, G., Restivo, A., Salemi, S.
openaire +1 more source
Random multilinear maps and the Erdős box problem
Discrete Analysis, 2021 Random multilinear maps and the Erdős box problem, Discrete Analysis 2021:17, 8 pp. A major theme in extremal combinatorics is determining the maximum number of edges that a graph or hypergraph can have if it does not contain a certain fixed graph or ...
David Conlon +2 more
doaj +1 more source
Optimal orientations of subgraphs of complete bipartite graphs
Transactions on Combinatorics, 2015 Summary: For a graph \(G\), let \(\mathcal{D}(G)\) be the set of all strong digraphs \(D\) obtained by the orientations of \(G\). The orientation number of \(G\) is \(\vec{d}(G)=\min \{d(D)\mid D\in \mathcal{D}(G)\}\), where \(d(D)\) denotes the diameter of the digraph \(D\).
Lakshmi, R. +2 more
openaire +3 more sources