A Course in Combinatorics
eBook - PDF

A Course in Combinatorics

J. H. van Lint, R. M. Wilson

Share book
  1. English
  2. PDF
  3. Available on iOS & Android
eBook - PDF

A Course in Combinatorics

J. H. van Lint, R. M. Wilson

Book details
Book preview
Table of contents
Citations

About This Book

This is the second edition of a popular book on combinatorics, a subject dealing with ways of arranging and distributing objects, and which involves ideas from geometry, algebra and analysis. The breadth of the theory is matched by that of its applications, which include topics as diverse as codes, circuit design and algorithm complexity. It has thus become essential for workers in many scientific fields to have some familiarity with the subject. The authors have tried to be as comprehensive as possible, dealing in a unified manner with, for example, graph theory, extremal problems, designs, colorings and codes. The depth and breadth of the coverage make the book a unique guide to the whole of the subject. The book is ideal for courses on combinatorical mathematics at the advanced undergraduate or beginning graduate level. Working mathematicians and scientists will also find it a valuable introduction and reference.

Frequently asked questions

How do I cancel my subscription?
Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
Can/how do I download books?
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
What is the difference between the pricing plans?
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
What is Perlego?
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Do you support text-to-speech?
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Is A Course in Combinatorics an online PDF/ePUB?
Yes, you can access A Course in Combinatorics by J. H. van Lint, R. M. Wilson in PDF and/or ePUB format, as well as other popular books in Mathématiques & Mathématiques discrètes. We have over one million books available in our catalogue for you to explore.

Information

Publisher
Cambridge University Press
Year
2001
ISBN
9780511668777
Edition
2
Topic
Mathématiques
Subtopic
Mathématiques discrètes
1.
Graphs
3
in
both
graphs
(using
1
,
2
,
3
,
4
,
5
,
6)
and
observe
that
the
edge
sets
are
the
same
sets
of
unordered
pairs.
Figure
1.3
A
permutation
σ
of
the
vertex
set
of
a
graph
G
with
the
property
that
{
a,
b
}
is
an
edge
if
and
only
if
{
σ
(
a
)
,
σ
(
b
)
}
is
an
edge,
is
called
an
automorphism
of
G
.
Problem
1A.
(i)
Show
that
the
drawings
in
Fig.
1.4
represent
the
same
graph
(or
isomorphic
graphs).
(ii)
Find
the
group
of
automorphisms
of
the
graph
in
Fig.
1.4.
Remark:
There
is
no
quick
or
easy
way
to
do
this
unless
you
are
lucky;
you
will
have
to
experiment
and
try
things.
Figure
1.4
The
complete
graph
K
n
on
n
vertices
is
the
simple
graph
that
has
all
(
n
2
)
possible
edges.
Two
vertices
a
and
b
of
a
graph
G
are
called
adjacent
if
they
are
distinct
and
joined
by
an
edge.
We
will
use
Γ(
x
)
to
denote
the
set
of
all
vertices
adjacent
to
a
given
vertex
x
;
these
vertices
are
also
called
the
neighbors
of
x
.

Table of contents