Listing 1 - 10 of 23 | << page >> |
Sort by
|
Choose an application
Choose an application
Choose an application
Choose an application
Combinatorial design theory is a vibrant area of combinatorics, connecting graph theory, number theory, geometry, and algebra with applications in experimental design, coding theory, and numerous applications in computer science. This volume is a collection of forty-one state-of-the-art research articles spanning all of combinatorial design theory. The articles develop new methods for the construction and analysis of designs and related combinatorial configurations; both new theoretical methods, and new computational tools and results, are presented. In particular, they extend the current state of knowledge on Steiner systems, Latin squares, one-factorizations, block designs, graph designs, packings and coverings, and develop recursive and direct constructions. The contributions form an overview of the current diversity of themes in design theory for those peripherally interested, while researchers in the field will find it to be a major collection of research advances. The volume is dedicated to Alex Rosa, who has played a major role in fostering and developing combinatorial design theory.
Choose an application
Covering a wide range of Random Graphs subjects, this volume examines series-parallel networks, properties of random subgraphs of the n-cube, random binary and recursive trees, random digraphs, induced subgraphs and spanning trees in random graphs as well as matchings, hamiltonian cycles and closure in such structures. Papers in this collection also illustrate various aspects of percolation theory and its applications, properties of random lattices and random walks on such graphs, random allocation schemes, pseudo-random graphs and reliability of planar networks. Several open problems that were presented during a special session at the Seminar are also included at the end of the volume.
Choose an application
Choose an application
Graph --- Combinatorial --- Induction --- Discrete Mathematics
Choose an application
Numerical methods of optimisation --- Discrete mathematics --- Stochastic processes
Choose an application
Ordered algebraic structures --- Discrete mathematics --- Commutative algebra --- Algèbres commutatives --- Congresses --- Congrès et conférences. --- Algèbres commutatives. --- Algèbres commutatives.
Choose an application
Covering a wide range of Random Graphs subjects, this volume examines series-parallel networks, properties of random subgraphs of the n-cube, random binary and recursive trees, random digraphs, induced subgraphs and spanning trees in random graphs as well as matchings, hamiltonian cycles and closure in such structures. Papers in this collection also illustrate various aspects of percolation theory and its applications, properties of random lattices and random walks on such graphs, random allocation schemes, pseudo-random graphs and reliability of planar networks. Several open problems
Discrete mathematics --- Combinatorial analysis --- Random graphs --- Probabilities --- Congresses --- Graphs, Random --- Graph theory --- Random graphs - Congresses --- Probabilities - Congresses --- Combinatorial analysis - Congresses
Listing 1 - 10 of 23 | << page >> |
Sort by
|