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)

• 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
• Enumeration of viral capsid assembly pathways: tree orbits under permutation group action
• On the number of zero-patterns of a sequence of polynomials
• Triangle-free distance-regular graphs
• On \(J_{m}\)-Hadamard matrices
• An upper bound for the number of planar lattice triangulations
• Affinity and fluctuations in a mesoscopic noria
• A note on triangle-free distance-regular graphs with \(a_2\neq 0\)
• An exact algorithm for the subset sum problem
• Lower bounds for the transition complexity of NFAs
• A note on the reducibility of special infinite series
• Combinatorial optimization in geometry
• Cluster size distributions of economic agents of many types in a market
• Maximal sets of mutually orthogonal Latin squares
• XSAT and NAE-SAT of linear CNF classes
• Title not available (Why is that?)
• The limitations of nice mutually unbiased bases
• A score test for linkage using identity by descent data from sibships
• How does Sudoku acquire integral eigenvalues?
• A new class of modified Bernstein operators
• A characterization of uniquely vertex colorable graphs using minimal defining sets
• Hadwiger's conjecture for powers of cycles and their complements
• Probabilistic extensions of the Erdős-Ko-Rado property
• Error graphs and the reconstruction of elements in groups
• Incomplete character sums and a special class of permutations
• Title not available (Why is that?)
• A \((0,1)\)-matrix existence theorem and equivalent tiling problems with dimers and monomers
• On the number of arcs in primitive digraphs with large exponents
• Designs, Groups and Computing
• Spectral hypergraph theory of the adjacency hypermatrix and matroids
• Kinematic formulas for finite lattices
• Algorithmic combinatorics based on slicing posets
• A note on commutators in compact semisimple Lie algebras
• Bounded capacity priority queues
• An equivalence of Ward's bound and its application
• An invariant for matrices and sets of points in prime characteristic
• Title not available (Why is that?)
• Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution
• Equivalent finite fuzzy sets and Stirling numbers
• When-and how-can a cellular automaton be rewritten as a lattice gas?
• The Narayana distribution
• Title not available (Why is that?)
• High connectivity keeping sets in graphs and digraphs
• On the optimum of Delsarte's linear program
• Proof of a conjectural supercongruence
• Prym varieties associated to graphs
• A worst-case analysis of the LZ2 compression algorithm
• Designs from subcode supports of linear codes
• Some characterizations of strongly regular graphs
• Superposition of zeros of distinct L-functions
• Gray code for permutations with a fixed number of cycles
• Clique coverings and partitions of line graphs
• A survey on modular Hadamard matrices
• Conditions for the existence of spreads in projective Hjelmslev spaces
• Linear-time option pricing algorithms by combinatorics
• Combinatorics of counting finite fuzzy subsets
• On the construction of perfect deletion-correcting codes using design theory
• Integer Programming for Classifying Orthogonal Arrays
• Title not available (Why is that?)
• Exponential growth and an asymptotic formula for the ranks of homotopy groups of a finite 1-connected complex
• Inclusion of forbidden minors in random representable matroids
• On normal matrices of zeros and ones with fixed row sum
• MV-algebra for cultural rules
• 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

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)