Universal Graph
Mathematics, Rado graph, Hypercube graph
978-613-6-25586-6
6136255863
52
2012-05-08
29.00 €
eng
https://images.our-assets.com/cover/230x230/9786136255866.jpg
https://images.our-assets.com/fullcover/230x230/9786136255866.jpg
https://images.our-assets.com/cover/2000x/9786136255866.jpg
https://images.our-assets.com/fullcover/2000x/9786136255866.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, a universal graph is an infinite graph that contains every finite graph as an induced subgraph. A universal graph of this type was first constructed by R. Rado and is now called the Rado graph or random graph. More recent work has focused on universal graphs for a graph family F: that is, an infinite graph belonging to F that contains all finite graphs in F. A universal graph for a family F of graphs can also refer to a member of a sequence of finite graphs that contains all graphs in F; for instance, every finite tree is a subgraph of a sufficiently large hypercube graph so a hypercube can be said to be a universal graph for trees.
https://www.morebooks.shop/books/gb/published_by/vertpress/193154/products
Mathematics
https://www.morebooks.shop/store/gb/book/universal-graph/isbn/978-613-6-25586-6