Coverart for item
The Resource A course in combinatorics

A course in combinatorics

Label
A course in combinatorics
Title
A course in combinatorics
Creator
Contributor
Subject
Language
eng
Cataloging source
UkLiU
http://library.link/vocab/creatorDate
1932-
http://library.link/vocab/creatorName
Lint, Jacobus Hendricus van
Index
no index present
Literary form
non fiction
http://library.link/vocab/relatedWorkOrContributorDate
1945-
http://library.link/vocab/relatedWorkOrContributorName
Wilson, R. M.
http://library.link/vocab/subjectName
Combinatorial analysis
Label
A course in combinatorics
Instantiates
Publication
Bibliography note
Includes bibliographical references and indexes
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Brooks' theorem
  • Ramsey's theorem and Ramsey numbers
  • The Erdos-Szekeres theorem
  • Turan's theorem and extremal graphs
  • Turan's theorem and extremal graph theory
  • Systems of distinct representatives
  • Bipartite graphs
  • P. Hall's condition
  • SDRs
  • Konig's theorem
  • Graphs
  • Birkhoff's theorem
  • Dilworth's theorem and extremal set theory
  • Partially ordered sets
  • Dilworth's theorem
  • Sperner's theorem
  • Symmetric chains
  • The Erdos-Ko-Rado theorem
  • Flows in networks
  • The Ford-Fulkerson theorem
  • The integrality theorem
  • Terminology of graphs and digraphs
  • Ageneralization of Birkhoff's theorem
  • De Bruijn sequences
  • The number of De Bruijn sequences
  • The addressing problem for graphs
  • Quadratic forms
  • Winkler's theorem
  • The principle of inclusion and exclusion; inversion formulae
  • Inclusion-exclusion
  • Derangements
  • Euler indicator
  • Eulerian circuits
  • Mobius function
  • Mobius inversion
  • Burnside's lemma
  • Probleme des menages
  • Permanents
  • Bounds on permanents
  • Schrijver's proof of the Minc conjecture
  • Fekete's lemma
  • Permanents of doubly stochastic matrices
  • The Van der Waerden conjecture
  • Hamiltonian circuits
  • The early results of Marcus and Newman
  • London's theorem
  • Egoritsjev's proof
  • Elementary counting; Stirling numbers
  • Stirling numbers of the first and second kind
  • Bell numbers
  • Generating functions
  • Trees
  • Cayley's theorem
  • Spanning trees and the greedy algorithm
  • Colorings of graphs and Ramsey's theorem
Dimensions
26 cm
Extent
xii, 530 pages
Isbn
9780521422604
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations
Label
A course in combinatorics
Publication
Bibliography note
Includes bibliographical references and indexes
Carrier category
volume
Carrier category code
  • nc
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • Brooks' theorem
  • Ramsey's theorem and Ramsey numbers
  • The Erdos-Szekeres theorem
  • Turan's theorem and extremal graphs
  • Turan's theorem and extremal graph theory
  • Systems of distinct representatives
  • Bipartite graphs
  • P. Hall's condition
  • SDRs
  • Konig's theorem
  • Graphs
  • Birkhoff's theorem
  • Dilworth's theorem and extremal set theory
  • Partially ordered sets
  • Dilworth's theorem
  • Sperner's theorem
  • Symmetric chains
  • The Erdos-Ko-Rado theorem
  • Flows in networks
  • The Ford-Fulkerson theorem
  • The integrality theorem
  • Terminology of graphs and digraphs
  • Ageneralization of Birkhoff's theorem
  • De Bruijn sequences
  • The number of De Bruijn sequences
  • The addressing problem for graphs
  • Quadratic forms
  • Winkler's theorem
  • The principle of inclusion and exclusion; inversion formulae
  • Inclusion-exclusion
  • Derangements
  • Euler indicator
  • Eulerian circuits
  • Mobius function
  • Mobius inversion
  • Burnside's lemma
  • Probleme des menages
  • Permanents
  • Bounds on permanents
  • Schrijver's proof of the Minc conjecture
  • Fekete's lemma
  • Permanents of doubly stochastic matrices
  • The Van der Waerden conjecture
  • Hamiltonian circuits
  • The early results of Marcus and Newman
  • London's theorem
  • Egoritsjev's proof
  • Elementary counting; Stirling numbers
  • Stirling numbers of the first and second kind
  • Bell numbers
  • Generating functions
  • Trees
  • Cayley's theorem
  • Spanning trees and the greedy algorithm
  • Colorings of graphs and Ramsey's theorem
Dimensions
26 cm
Extent
xii, 530 pages
Isbn
9780521422604
Media category
unmediated
Media MARC source
rdamedia
Media type code
  • n
Other physical details
illustrations

Library Locations

    • Harold Cohen LibraryBorrow it
      Ashton Street, Liverpool, L69 3DA, GB
      53.418074 -2.967913
Processing Feedback ...