COMBINATORICS
P1: FCH/FYXP2: FCH/FYXQC: FCH/UKST1: FCHFrontmatterWB00623-TuckerNovember 1, 201112:27iiThis page is intentionally left : FCH/FYXP2: FCH/FYXQC: FCH/UKST1: FCHFrontmatterWB00623-TuckerNovember 1, 201112:27APPLIEDCOMBINATORICSiP1: FCH/FYXP2: FCH/FYXQC: FCH/UKST1: FCHFrontmatterWB00623-TuckerNovember 1, 201112:27iiThis page is intentionally left : FCH/FYXP2: FCH/FYXQC: FCH/UKST1: FCHFrontmatterWB00623-TuckerNovember 28, 20118:0APPLIEDCOMBINATORICSALAN TUCKERSUNY Stony BrookJohn Wiley & Sons, : FCH/FYXP2: FCH/FYXQC: FCH/UKST1: FCHFrontmatterWB00623-TuckerDecember 1, 201116:7VP AND PUBLISHERLaurie RosatonePROJECT EDITORShannon CorlissMARKETING MANAGERDebi DoyleMARKETING ASSISTANTPatrick FlatleyPRODUCTION MANAGERJanis SooASSISTANT PRODUCTION EDITOREl
also be used for a one-quarter course in applied graph theory or a one-semester or one-quarter course in enumerative combinatorics (starting from Chapter 5). A typical one-semester undergraduate discrete methods course should cover most of Chapters 1 to 3 and 5 to 8, with selected topics from other chapters if time permits.
Download COMBINATORICS
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: