On Sets and Graphs - Perspectives on Logic and Combinatorics (Paperback, Softcover reprint of the original 1st ed. 2017)

This treatise presents an integrated perspective on the interplay of set theory and graph theory, providing an extensive selection of examples that highlight how methods from one theory can be used to better solve problems originated in the other. Features: explores the interrelationships between sets and graphs and their applications to finite combinatorics; introduces the fundamental graph-theoretical notions from the standpoint of both set theory and dyadic logic, and presents a discussion on set universes; explains how sets can conveniently model graphs, discussing set graphs and set-theoretic representations of claw-free graphs; investigates when it is convenient to represent sets by graphs, covering counting and encoding problems, the random generation of sets, and the analysis of infinite sets; presents excerpts of formal proofs concerning graphs, whose correctness was verified by means of an automated proof-assistant; contains numerous exercises, examples, definitions, problems and insight panels.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Release date:	September 2018
First published:	2017
Authors:	Eugenio G. Omodeo • Alberto Policriti • Alexandru I. Tomescu
Dimensions:	235 x 155 x 16mm (L x W x T)
Format:	Paperback
Pages:	275
Edition:	Softcover reprint of the original 1st ed. 2017
ISBN-13:	978-3-319-85536-3
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Computing & IT > General theory of computing > Data structures Books > Computing & IT > Computer programming > Algorithms & procedures Promotions
LSN:	3-319-85536-0
Barcode:	9783319855363

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!