Balanced online Ramsey games in random graphs.
Balanced path decomposition of and
Let denote a path with edges and denote the -fold complete bipartite graph with both parts of size . In this paper, we obtain the necessary and sufficient conditions for to have a balanced -decomposition. We also obtain the directed version of this result.
Balanced problems on graphs with categorization of edges
Suppose a graph G = (V,E) with edge weights w(e) and edges partitioned into disjoint categories S₁,...,Sₚ is given. We consider optimization problems on G defined by a family of feasible sets (G) and the following objective function: For an arbitrary number of categories we show that the L₅-perfect matching, L₅-a-b path, L₅-spanning tree problems and L₅-Hamilton cycle (on a Halin graph) problem are NP-complete. We also summarize polynomiality results concerning above objective functions for arbitrary...
Balanced Subdivision and Enumeration in Balanced Spheres.
Balanced ternary designs with block size three, any ... and any R.
Balancing cyclic -ary Gray codes.
Balancing cyclic -ary Gray codes. II.
Balls on the lawn.
Band combinatorics of domestic string algebras
We prove that the multiplicity of a simple module as a composition factor in a composition series for a primitive band module over a domestic string algebra is at most two.
Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle.
Bartholdi zeta functions for hypergraphs.
Bartholdi zeta functions of fractal graphs.
Barycentric Ramsey numbers for small graphs.
Barycentric-sum problems: a survey.
Bases of certain finite groups
Bases of classes of trees closed under subdivisions
Bases of web Configurations
Basic calculus of signed permutations. II: Finite analogues of Bessel functions. (Calcul basique des permutations signées. II: Analogues finis des fonctions de Bessel.)
Basic hypergeometric identities: An introductory revisiting through the Carlitz inversions.
Basic polyhedra in knot theory