Balls on the lawn.
Basic calculus of signed permutations. II: Finite analogues of Bessel functions. (Calcul basique des permutations signées. II: Analogues finis des fonctions de Bessel.)
Baxter permutations and plane bipolar orientations.
Baxter permutations. (Permutations de Baxter.)
Bell and Stirling numbers for graphs.
Bell polynomials and degenerate stirling numbers
Bicoloured Dyck paths and the contact polynomial for non-intersecting paths in a half-plane lattice.
Bijections for hook pair identities.
Bijective counting of tree-rooted maps and shuffles of parenthesis systems.
Bijective proofs of identities from colored binary trees.
Bijective recurrences concerning Schröder paths.
Binary -words without the subword 1010. . . 10.
Binary strings without zigzags.
Binary words containing infinitely many overlaps.
Bounds on the number of integer valued monotone functions of k integer arguments
Broken Circuits in Matroids-Dohmen’s Inductive Proof
Dohmen [4] gives a simple inductive proof of Whitney’s famous broken circuits theorem. We generalise his inductive proof to the case of matroids