Block Intersections in Quasi-Residual Designs.
Displaying 161 – 180 of 1135
Block Intersections in Quasi-Residual Designs. (Short Communication).
J.F. Lawless (1970)
Aequationes mathematicae
Blocking sets of 16 points in projective planes of order 10 - III
Jürgen Bierbrauer (1985)
Rendiconti del Seminario Matematico della Università di Padova
Blocking sets of maximal type in finite projective planes
Jürgen Bierbrauer (1981)
Rendiconti del Seminario Matematico della Università di Padova
Boundary of the union of rectangles in the plane
Václav Medek (1983)
Aplikace matematiky
Given rectangles in a plane whose all sides belong to two perpendicular directions, an algorithm for the construction of the boundary of the union of those rectangles is shown in teh paper.
Bounding the Rank of Certain Permutation Groups.
Peter J. Cameron (1972)
Mathematische Zeitschrift
Broken Circuits in Matroids-Dohmen’s Inductive Proof
Wojciech Kordecki, Anna Łyczkowska-Hanćkowiak (2013)
Discussiones Mathematicae Graph Theory
Dohmen [4] gives a simple inductive proof of Whitney’s famous broken circuits theorem. We generalise his inductive proof to the case of matroids
Characterisation of some sparse binary sequential arrays.
C.E. Praeger, Anne Penfold Street (1983)
Aequationes mathematicae
Characterisation of Some Steiner Systems, Parallelisms, and Biplanes.
Peter J. Cameron (1974)
Mathematische Zeitschrift
Characterizations of transversal and fundamental transversal matroids.
Bonin, Joseph E., Kung, Joseph P.S., de Mier, Anna (2011)
The Electronic Journal of Combinatorics [electronic only]
Chohomological Aspects of Two-Graphs.
Peter J. Cameron (1977)
Mathematische Zeitschrift
Chromatic Number And The Spectrum Of A Graph
Dragoš M. Cvetković (1972)
Publications de l'Institut Mathématique
Circle-packing connections with random walks and a finite volume method
Tomasz Dubejko (1996/1997)
Séminaire de théorie spectrale et géométrie
Circuit and cocircuit partitions of binary matroids
Eunice Gogo Mphako (2006)
Czechoslovak Mathematical Journal
We give an example of a class of binary matroids with a cocircuit partition and we give some characteristics of a set of cocircuits of such binary matroids which forms a partition of the ground set.
Circulants and the chromatic index of Steiner triple systems
Mariusz Meszka, Roman Nedela, Alexander Rosa (2006)
Mathematica Slovaca
Classification of flocks of the quadratic cone over fields of order at most 29.
Law, M., Penttila, T. (2003)
Advances in Geometry
Classification of generalized Hadamard matrices and quaternary Hermitian self-dual codes of length 18.
Harada, Masaaki, Lam, Clement, Munemasa, Akihiro, Tonchev, Vladimir D. (2010)
The Electronic Journal of Combinatorics [electronic only]
Classification of Maximal Optical Orthogonal Codes of Weight 3 and Small Lengths
Baicheva, Tsonka, Topalova, Svetlana (2015)
Serdica Journal of Computing
Dedicated to the memory of the late professor Stefan Dodunekov on the occasion of his 70th anniversary. We classify up to multiplier equivalence maximal (v, 3, 1) optical orthogonal codes (OOCs) with v ≤ 61 and maximal (v, 3, 2, 1) OOCs with v ≤ 99. There is a one-to-one correspondence between maximal (v, 3, 1) OOCs, maximal cyclic binary constant weight codes of weight 3 and minimum dis tance 4, (v, 3; ⌊(v − 1)/6⌋) difference packings, and maximal (v, 3, 1) binary cyclically permutable constant...
Classification of the Steiner quadruple systems of cardinality 32
M. H. Armanious (1989)
Beiträge zur Algebra und Geometrie = Contributions to algebra and geometry
Class-uniformly resolvable group divisible structures. I: Resolvable group divisible designs.
Danziger, Peter, Stevens, Brett (2004)
The Electronic Journal of Combinatorics [electronic only]