Asymptotically optimal box packing theorems.
Asymptotically optimal tree-packings in regular graphs.
Asymptotics for the number of -quasigroups of order 4.
Atomic Latin squares based on cyclotomic orthomorphisms.
Automorphism Groups of Designs.
Avoidance in triple systems.
Balanced ternary designs with block size three, any ... and any R.
Bases of certain finite groups
Bases of web Configurations
Bergman complexes, Coxeter arrangements, and graph associahedra.
Bicoloring Steiner triple systems.
Biembeddings of symmetric configurations and 3-homogeneous Latin trades
Using results of Altshuler and Negami, we present a classification of biembeddings of symmetric configurations of triples in the torus or Klein bottle. We also give an alternative proof of the structure of 3-homogeneous Latin trades.
Binary codes and partial permutation decoding sets from the odd graphs
For k ≥ 1, the odd graph denoted by O(k), is the graph with the vertex-set Ωk, the set of all k-subsets of Ω = 1, 2, …, 2k +1, and any two of its vertices u and v constitute an edge [u, v] if and only if u ∩ v = /0. In this paper the binary code generated by the adjacency matrix of O(k) is studied. The automorphism group of the code is determined, and by identifying a suitable information set, a 2-PD-set of the order of k 4 is determined. Lastly, the relationship between the dual code from O(k)...
Binary linear forms over finite sets of integers
Binary multiples of combinatorial geometries
Binary multiples of combinatorial geometries - II
Binomial residues
A binomial residue is a rational function defined by a hypergeometric integral whose kernel is singular along binomial divisors. Binomial residues provide an integral representation for rational solutions of -hypergeometric systems of Lawrence type. The space of binomial residues of a given degree, modulo those which are polynomial in some variable, has dimension equal to the Euler characteristic of the matroid associated with .
Bioctic Gauss sums and sixteenth power residue difference sets
Bipartite graphs that are not circle graphs
The following result is proved: if a bipartite graph is not a circle graph, then its complement is not a circle graph. The proof uses Naji’s characterization of circle graphs by means of a linear system of equations with unknowns in .At the end of this short note I briefly recall the work of François Jaeger on circle graphs.
Biplanes.