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 (only showing first 100 items - show all)

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 ⋮ Partitions, their classes, and multicolour evenness ⋮ 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 ⋮ 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

This page was built for publication: