Surveys in Combinatorics 1985: Invited Papers for the Tenth British Combinatorial Conference
Cambridge University Press, Jul 25, 1985 - Mathematics - 180 pages
The British Combinatorial Conference is an established biennial international gathering. This volume contains the invited papers presented, by several distinguished mathematicians, at the 1985 conference. The papers cover a broad range of combinatorial topics, including cryptography, greedy algorithms, graph minors, flows through random networks, (0, 1)-distance problems, irregularities of point distributions and reconstruction of infinite graphs.
Try this search over all volumes: disjoint
Results 1-0 of 0
What people are saying - Write a review
We haven't found any reviews in the usual places.
Irregularities of distribution and combinatorics
Adaptive algorithms for communications
On greedy algorithms that succeed
4 other sections not shown
2-edge-connected ABD(k,w acyclic Andrews antichain B-type Beck Bernoulli distribution channel circuits column complete graphs conjecture connected consider Corollary cutset DCP problems define denote detachment discrete disjoint distance distribution function edge-capacities edge-resistances edges joining effective resistance electrical networks Euler trail example exists finite graph frequency function F g-detachment of G generalised graph G greedy algorithm Grimmett Hamiltonian decomposition Hoffman independent random infinite antichain Lemma Let G linear programming London Math lower bound Mathematical matrix matroids max-flow min-cut theorem maximal maximum flow minor isomorphic mock theta functions modulation necessary and sufficient network flows order mock theta pair partitions path path-width planar graph points polynomial positive integer proof of Theorem prove q-series r-edge-colouring Ramanujan statistic random capacities random variables Rogers-Ramanujan Rogers-Ramanujan identities rows satisfies Section sequence signal simple g-detachment structure theorem subgraph subset surface theory tournament code tree tree-width valencies vertex vertices of G well-quasi-ordered