scientific article

Publication date: 5 November 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Association schemes, strongly regular graphs (05E30) Transversal (matching) theory (05D15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx) Designs and configurations (05Bxx)

Related Items

Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs, An efficient shift rule for the prefer-max de Bruijn sequence, A new proof of Cayley's formula for labeled spanning trees, Two-weight codes, graphs and orthogonal arrays, The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities, The super-connectivity of Kneser graphs, Correlations between the ranks of submatrices and weights of random codes, An update on a few permanent conjectures, Secure overlay network design, Sudoku rectangle completion (extended abstract), Hermitian rank distance codes, Large sets of $t$-designs through partitionable sets: a survey, The generalized Füredi conjecture holds for finite linear lattices, Indirect reciprocity with optional interactions and private information, A number-theoretic approach to homotopy exponents of $\text{SU}(n)$, On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture, Silver block intersection graphs of Steiner 2-designs, Bi-resolving graph homomorphisms and extensions of bi-closing codes, Maximal equilateral sets, Combinatorial enumeration of $2\times 2$ ribbon patterns, Brunn--Minkowski inequalities for contingency tables and integer flows, The zerodivisor graph of a qoset, Delsarte set graphs with small $c_{2}$, The zero-divisor graphs of posets and an application to semigroups, Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer, Design and analysis of experiments testing for biodiversity effects in ecology, Determination of the sizes of optimal $(m,n,k,\lambda,k-1)$-OOSPCs for $\lambda=k-1, k$, Some new upper bounds of $\operatorname{ex}(n;\{C_3,C_4\})$, A short note on a short remark of Graham and Lovász, Pooling semilattices and non-adaptive pooling designs, Combinatorial aspects of Parker's model, Random graphs from a weighted minor-closed class, Note on the spectral characterization of some cubic graphs with maximum number of triangles, Modular adjacency algebras of dual polar schemes, Harmonic analysis of finite lamplighter random walks, The extendability of matchings in strongly regular graphs, Order polynomials and Pólya's enumeration theorem., On a symmetric representation of Hermitian matrices and its applications to graph theory, The equivalent representation of the breadth-one $D$-invariant polynomial subspace and its discretization, Weight distribution of rank-metric codes, Two classes of optimal two-dimensional OOCs, New bounds for the $\max$-$k$-cut and chromatic number of a graph, Rational decomposition of dense hypergraphs and some related eigenvalue estimates, The asymmetry number of finite tournaments, and some related results, Pure Weierstrass gaps from a quotient of the Hermitian curve, Triangular random matrices and biorthogonal ensembles, Minimum rectilinear Steiner tree of $n$ points in the unit square, The card game SET., On a conjecture of polynomials with prescribed range, Frugal, acyclic and star colourings of graphs, Structures and lower bounds for binary covering arrays, On the structure of the $h$-vector of a paving matroid, Some comments on Latin squares and on Graeco-Latin squares, illustrated with postage stamps and old playing cards, On the inapproximability of maximum intersection problems, On a quasi-ordering on Boolean functions, All primitive strongly regular graphs except four are hyperenergetic, Modular adjacency algebras of Grassmann graphs, Supercongruences motivated by $e$, A short proof of a theorem of Falmagne., Polynomial-time perfect matchings in dense hypergraphs, Separation cutoffs for random walk on irreducible representations, Bipartite partial duals and circuits in medial graphs, Random Latin squares and 2-dimensional expanders, Connector families of graphs, Symmetric bilinear forms over finite fields with applications to coding theory, Hermite spline interpolation on a three direction mesh from Powell-Sabin and Hsieh-Clough-Tocher finite elements, Shuffles of trees, Max-cut and extendability of matchings in distance-regular graphs, On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries, Difference set constructions of DRADs and association schemes, An improved combinatorial approach for pricing Parisian options, The discrepancy of the lex-least de Bruijn sequence, A strong log-concavity property for measures on Boolean algebras, Counting elements and geodesics in Thompson's group $F$., On the number of Sudoku squares, Regular choice systems: a general technique to represent them by random variables, Amorphic association schemes with negative Latin square-type graphs, On Ryser's conjecture for linear intersecting multipartite hypergraphs, A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles, Construction of a superimposed code using partitions, Random graphs from a block-stable class, A characterization of strongly regular graphs in terms of the largest signless Laplacian eigenvalues, A Ramsey-type result for geometric $\ell$-hypergraphs, A generalization of the Gaussian formula and a $q$-analog of Fleck's congruence, New negative Latin square type partial difference sets in nonelementary Abelian 2-groups and 3-groups, Non-embeddability of geometric lattices and buildings, Commutativity of the adjacency matrices of graphs, On set systems with restricted intersections modulo $p$ and $p$-ary $t$-designs, Strongly regular tri-Cayley graphs, A combinatorial construction of the Gray map over Galois rings, Matrices with prescribed row and column sums, On a conjecture of Brouwer involving the connectivity of strongly regular graphs, Eulerian and even-face ribbon graph minors, Commutative association schemes, Optimization, block designs and no free lunch theorems, Avoiding brooms, forks, and butterflies in the linear lattices, On Beck's coloring of posets, Block designs with near-minimal number of blocks, Large regular simplices contained in a hypercube, A bound on the Laplacian spread which is tight for strongly regular graphs, A relative $m$-cover of a Hermitian surface is a relative hemisystem, Design theory from the viewpoint of algebraic combinatorics, Latin squares with no transversals, Automating change of representation for proofs in discrete mathematics (extended version), An $L$-system on the small Witt design, Overlap in consistent cycles, Symbolic dynamics of Boolean control networks, Semi-distance codes and Steiner systems, Bi-Lipschitz bijection between the Boolean cube and the Hamming ball, Reflexive analysis of equilibria in a triopoly game with linear cost functions of the agents, Disconnecting strongly regular graphs, The Terwilliger algebra of the halved folded $2n$-cube from the viewpoint of its automorphism group action, Representation theory of wreath products of finite groups, On the number of planar Eulerian orientations, Permutation-invariant qudit codes from polynomials, Polynomial size IP formulations of knapsack may require exponentially large coefficients, Computing similarity distances between rankings, Trapezoidal diagrams, upward triangulations, and prime Catalan numbers, Vertex coloring of a graph for memory constrained scenarios, Concentration of maximum degree in random planar graphs, Stochastic modelling of genetic algorithms, Automorphism groups of Steiner triple systems, Partitions, Diophantine equations, and control systems, A new family of partial difference sets in 3-groups, On a question of Sós about 3-uniform friendship hypergraphs, On the integral kernels of derivatives of the Ornstein–Uhlenbeck semigroup, On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design, Moments of the support weight distribution of linear codes, Expander graphs and their applications, Lower bounds on the size of spheres of permutations under the Chebychev distance, Unifying some known infinite families of combinatorial 3-designs, Fixing monotone Boolean networks asynchronously, Selection for mutational robustness in finite populations, The maximum cut problem on blow-ups of multiprojective spaces, Implications of vanishing Krein parameters on Delsarte designs, with applications in finite geometry, EXISTENCE OF -ANALOGS OF STEINER SYSTEMS, Self-dual bent sequences for complex Hadamard matrices, Proof of a conjecture involving derangements and roots of unity, On symmetric association schemes and associated quotient-polynomial graphs, The discretization for a special class of ideal projectors, Maximal nonassociativity via fields, A unified approach to combinatorial key predistribution schemes for sensor networks, Divisibility properties of random samples of integers, Computational Complexity of SRIC and LRIC Indices, Coloured and Directed Designs, Gravitational allocation for uniform points on the sphere, Markov bases for noncommutative Fourier analysis of ranked data, The topology of certain 3-Sasakian 7-manifolds, Exact enumeration of self-avoiding walks, Thresholds versus fractional expectation-thresholds, Rainbow Matchings: existence and counting, On the complexity of matrix reduction over finite fields, Proper partial geometries with Singer groups and pseudogeometric partial difference sets, Planar Eulerian triangulations are equivalent to spherical Latin bitrades, Characterizing the reconstruction and enumerating the patterns of DNA sequences with re\-peats, New results related to a conjecture of Manickam and Singhi, Lattice paths and $n$-colour compositions, Some Refinements of Star Graphs Whose SemigroupSSatisfiesS³ = 0, Enumerating extensions of mutually orthogonal Latin squares, Asymptotic enumeration of permutations avoiding generalized patterns, Addressing graph products and distance-regular graphs, A note on majorization transforms and Ryser's algorithm, Pseudocyclic association schemes arising from the actions of PGL$(2,2^{m})$ and P$\Gamma$L$(2,2^{m}$), On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs, An approximation algorithm for counting contingency tables, Characterizations of bipartite and Eulerian partial duals of ribbon graphs, Independent coverings and orthogonal colourings, A new sieve for restricted multiset counting, Graphic deviation, On explicit random-like tournaments, Left ideals of matrix rings and error-correcting codes, Some observations on the smallest adjacency eigenvalue of a graph, Quadratic and symmetric bilinear forms over finite fields and their association schemes, Partial difference sets in $C_{2^n} \times C_{2^n}$, Gromov hyperbolic graphs arising from iterations, On subsets of the hypercube with prescribed Hamming distances, New code upper bounds for the folded $n$-cube, Regular orbits of quasisimple linear groups. II, Non-existence and construction of pre-difference sets, and equi-distributed subsets in association schemes, Geometric designs and rotatable designs. I, Deciding absorption, The Terwilliger algebra of the halved $n$-cube from the viewpoint of its automorphism group action, A gap for the maximum number of mutually unbiased bases, When will the Stanley depth increase?, Recent progress in algebraic design theory, Variations on Instant Insanity, Memetic collaborative approaches for finding balanced incomplete block designs, Demi-matroids from codes over finite Frobenius rings, The invention of new sequences through classifying and counting fuzzy matrices, Lengths of monotone subsequences in a Mallows permutation, On the computational power of probabilistic and quantum branching program, On the generalized restricted sumsets in abelian groups, Coordination through de Bruijn sequences, A new eigenvalue bound for independent sets, Lower bounds on the maximum number of non-crossing acyclic graphs, Information-bit error rate and false positives in an MDS code, Systems of distant representatives in Euclidean space, On the number of 1-factorizations of a complete graph, Stein's method and the rank distribution of random matrices over finite fields, On coupon colorings of graphs, Formulations of the inclusion–exclusion principle from Legendre to Poincaré, with emphasis on Daniel Augusto da Silva, Bounding the Optimal Rate of the ICSI and ICCSI problem, Top-heavy phenomena for transformations, On symmetric intersecting families of vectors, Graviton scattering in self-dual radiative space-times, Counting Subgraphs in Degenerate Graphs, Transformation à la Foata for special kinds of descents and excedances, Determination of the size of defining set for Steiner triple systems, The Induced Partial Order on the set of Finite Subsets of a Partially Ordered Set, Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices, Unnamed Item, Constructing cyclic PBIBD(2)s through an optimization approach: Thirty‐two new cyclic designs, Uniform estimates for almost primes over finite fields, Unnamed Item, COLORING CURVES ON SURFACES, An Upper Bound on the Size of Sidon Sets, Substructures in Latin squares, Algebraic restriction codes and their applications, Symmetric Layer-Rainbow Colorations of Cubes, A COMBINATORIAL IDENTITY AND THE FINITE DUAL OF INFINITE DIHEDRAL GROUP ALGEBRA, On the largest part size of low‐rank combinatorial assemblies, A spectral bound for vertex-transitive graphs and their spanning subgraphs, Another expression of the MacWilliams identities and its applications, Pareto H-eigenvalues of nonnegative tensors and uniform hypergraphs, On the 430-cap of $\mathrm{PG}(6,4)$ having two intersection sizes with respect to hyperplanes, Large deviations in random latin squares, 2-reconstructibility of strongly regular graphs and 2-partially distance-regular graphs, Adjacencies on random ordering polytopes and flow polytopes, The best-worst-choice polytope on four alternatives, Depth lower bounds in Stabbing Planes for combinatorial principles, Optimal transport for some symmetric, multidimensional integer partitions, Polytope compatibility—From quantum measurements to magic squares, Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions, Universal p‐ary designs, Quantum algorithm for lexicographically minimal string rotation, Necessary and sufficient conditions for convergence to the semicircle distribution, Inclusion matrices for rainbow subsets, Partial geometric designs having circulant concurrence matrices, On the connectivity and diameter of geodetic graphs, Border-collision bifurcations from stable fixed points to any number of coexisting chaotic attractors, Unnamed Item, On Betti numbers of flag complexes with forbidden induced subgraphs, On some conjectural hypergeometric congruences, Unnamed Item, Unfoldings of the Cube, On the comaximal ideal graph of a commutative ring, On graphs whose Laplacian matrices have distinct integer eigenvalues, A CHARACTERIZATION OF MATROIDS IN TERMS OF SURFACES, Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs, Packing, counting and covering Hamilton cycles in random directed graphs, Depth of factors of square free monomial ideals, Combinatorial congruences modulo prime powers, On the Number of Linearly Independent Equations Generated by XL, Unnamed Item, A new proof of the Hansen-Mullen irreducibility conjecture, Open problems in the spectral theory of signed graphs, Some properties of comaximal ideal graph of a commutative ring, Vector weighted Stirling numbers and an application in graph theory, On the threshold problem for Latin boxes, An Extension of Mantel’s Theorem to k-Graphs, Fundamentals of coding type problems, Global Density Analysis for an Off-Lattice Agent-Based Model, Fault‐tolerant routings with minimum optical index, Does Eulerian percolation on $Z^2$ percolate ?, Unnamed Item, Measure preserving words are primitive, Sequences of numbers via permutation polynomials over some finite rings, Unnamed Item