scientific article; zbMATH DE number 51878

zbMATH Open0769.05001MaRDI QIDQ4002255FDOQ4002255

Authors: Richard M. Wilson, Jack van Lint 

Publication date: 23 January 1993

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 425392
• scientific article
• scientific article; zbMATH DE number 686998

zbMATH Keywords

partitionsgraphscombinatoricsnetworksembeddingsgenerating functionsLatin squarescodescombinatorial geometriesextremal graphscoloringsHadamard matricesRamsey's theoremprojective geometriesdesignsDilworth's theoremintroductionvan der Waerden conjecture

Mathematics Subject Classification ID

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

Cited In (only showing first 100 items - show all)

• Derangements in finite classical groups for actions related to extension field and imprimitive subgroups and the solution of the Boston–Shalev conjecture
• Title not available (Why is that?)
• Universal Associative Envelopes of Nonassociative Triple Systems
• Finite state incompressible infinite sequences
• An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
• The parameters of bipartite \(Q\)-polynomial distance-regular graphs
• Finite posets and Ferrers shapes
• New Nordhaus-Gaddum-type results for the Kirchhoff index
• Families of sets not belonging to algebras and combinatorics of finite sets of ultrafilters
• Random planar graphs with bounds on the maximum and minimum degrees
• Inversion Of A Generalized Vandermonde Matrix
• On the number of tilings of a square by rectangles
• More on pooling spaces
• A characterization of Delsarte's linear programming bound as a ratio bound
• Finite state complexity
• Vertex coloring acyclic digraphs and their corresponding hypergraphs
• A \(q\)-analog of approximation inclusion-exclusion
• An upper bound on the number of high-dimensional permutations
• Some colouring problems for Paley graphs
• Extremal problems in Minkowski space related to minimal networks
• The polytope of degree sequences of hypergraphs
• 5-chromatic strongly regular graphs
• Lectures on advances in combinatorics
• On the number of blocks in a generalized Steiner system
• Title not available (Why is that?)
• On the size of the minimum critical set of a Latin square
• Maintaining transitive closure in first order after node-set and edge-set deletions
• New recurrence algorithms for the nonclassic Adomian polynomials
• Generalized binomial coefficients and the subset-subspace problem
• New families of graphs without short cycles and large size
• Decimations of languages and state complexity
• CMV: The unitary analogue of Jacobi matrices
• Least squares isotonic regression in two dimensions
• The effective length of subcodes
• Mappings of Latin squares
• On computing the number of Latin rectangles
• On a connection between symmetric polynomials, generalized Stirling numbers and the Newton general divided difference interpolation polynomial.
• Pólya distributions, combinatorial identities, and generalized stirling numbers
• A new approach to the theory of classical hypergeometric polynomials
• Regular LDPC codes from semipartial geometries
• Hamilton cycles and eigenvalues of graphs
• Ring geometries, two-weight codes, and strongly regular graphs
• Boundary partitions in trees and dimers
• Signed domination in regular graphs and set-systems
• A candidate for the ``Next Fermat Problem
• Explicit inverse of a generalized Vandermonde matrix.
• \(r\)-strong edge colorings of graphs
• Spreads in strongly regular graphs
• The geometry of graphs and some of its algorithmic applications
• Zeros of principal \(L\)-functions and random matrix theory
• On the vertices of the \(d\)-dimensional Birkhoff polytope
• Tight bounds for eternal dominating sets in graphs
• The permanent of a square matrix
• Difference sets and intercalation pairs
• Steinitz classes of unimodular lattices
• On graphs with three eigenvalues
• Bose-Mesner algebras related to type II matrices and spin models
• Linear CNF formulas and satisfiability
• On the number of cycles in generalized Kautz digraphs
• Results on rotation symmetric polynomials over \(GF(p)\)
• Statistics for phylogenetic trees
• A class of cyclic \((v; k_{1}, k_{2}, k_{3}; \lambda)\) difference families with \(v \equiv 3\, (\text{mod}\, 4)\) a prime
• Constructions and bounds for mixed-dimension subspace codes
• Random planar graphs
• The combinatorics of Dom de Caen
• Code equivalence characterizes finite Frobenius rings
• Intersection properties for coverings of \(G\)-spaces
• Title not available (Why is that?)
• A course in combinatorics.
• \(\text{ALR}^n\): accelerated higher-order logistic regression
• Coloring the square of graphs whose maximum average degree is less than 4
• Quadratic double circulant codes over fields
• A Kruskal-Katona type theorem for graphs
• Systems of random equations over finite algebraic structures
• Title not available (Why is that?)
• Conference matrices and unimodular lattices
• Not So Many Runs in Strings
• Title not available (Why is that?)
• Bounds on the number and sizes of conjugacy classes in finite Chevalley groups with applications to derangements.
• Quasi-cyclic codes over \(\mathbb F_{13}\) and enumeration of defining polynomials
• Low-lying zeros of quadratic Dirichlet \(L\)-functions, hyper-elliptic curves and random matrix theory
• Order-unit quantum Gromov--Hausdorff distance
• Minimal systems of binomial generators and the indispensable complex of a toric ideal
• Hadamard tensors and lower bounds on multiparty communication complexity
• Hypomorphy of graphs up to complementation
• Some new evaluations of the Tutte polynomial
• Exact spectra of conformal supersymmetric nonlinear sigma models in two dimensions
• A classification of the structures of some Sperner families and superimposed codes
• The lattice of integral flows and the lattice of integral cuts on a finite graph
• On a connection between the Pascal, Vandermonde and Stirling matrices. I.
• A combinatorial approach for studying local operations and classical communication transformations of multipartite states
• Orthogonal decomposition and packing of complete graphs
• Most Latin squares have many subsquares
• Bell numbers and \(k\)-trees
• The distribution of spacings between quadratic residues
• A combinatorial problem associated with nonograms
• Contrast-optimal k out of n secret sharing schemes in visual cryptography
• The maximum determinant of \(\pm 1\) matrices
• Liouville, computable, Borel normal and Martin-Löf random numbers
• Partition arguments in multiparty communication complexity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4002255)