Star-Critical Ramsey Numbers for Graphs
This text is a comprehensive survey of the literature surrounding star-critical Ramsey numbers. First defined by Jonelle Hook in her 2010 dissertation, these numbers aim to measure the sharpness of the corresponding Ramsey numbers by determining the minimum number of edges needed to be added to a cr...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Korporativní autor: | |
| Médium: | Elektronický zdroj E-kniha |
| Jazyk: | angličtina |
| Vydáno: |
Cham :
Springer International Publishing : Imprint: Springer,
2023.
|
| Vydání: | 1st ed. 2023. |
| Edice: | SpringerBriefs in Mathematics,
|
| Témata: | |
| On-line přístup: | https://doi.org/10.1007/978-3-031-29981-0 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-29981-0 | ||
| 003 | DE-He213 | ||
| 005 | 20260906083129.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 230513s2023 sz | o |||| 0|eng d | ||
| 020 | |a 9783031299810 |9 978-3-031-29981-0 | ||
| 024 | 7 | |a 10.1007/978-3-031-29981-0 |2 doi | |
| 050 | 4 | |a QA166-166.247 | |
| 072 | 7 | |a PBV |2 bicssc | |
| 072 | 7 | |a MAT008000 |2 bisacsh | |
| 072 | 7 | |a PBV |2 thema | |
| 082 | 0 | 4 | |a 511.5 |2 23 |
| 100 | 1 | |a Budden, Mark R. |e author. |0 (orcid)0000-0002-4065-6317 |1 https://orcid.org/0000-0002-4065-6317 |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Star-Critical Ramsey Numbers for Graphs |h [electronic resource] / |c by Mark R. Budden. |
| 250 | |a 1st ed. 2023. | ||
| 264 | 1 | |a Cham : |b Springer International Publishing : |b Imprint: Springer, |c 2023. | |
| 300 | |a 1 online resource (XIII, 92 p. 43 illus.). |b 42 illus. in color. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 341 | 0 | |b Table of contents navigation |2 onix | |
| 341 | 0 | |b Single logical reading order |2 onix | |
| 341 | 0 | |b Short alternative textual descriptions |2 onix | |
| 341 | 0 | |b Use of colour is Not sole means of conveying information |2 onix | |
| 341 | 0 | |b Use of high contrast between text and background colour |2 onix | |
| 341 | 0 | |b Next / Previous structural navigation |2 onix | |
| 341 | 0 | |b All Non-decorative content supports reading without sight |2 onix | |
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a SpringerBriefs in Mathematics, |x 2191-8201 | |
| 505 | 0 | |a 1. Multi Star-Critical Ramsey Numbers -- 2. Non-Complete Graphs -- 3. Generalizations of Star-Critical Ramsey Numbers -- 4. Open Problems. | |
| 520 | |a This text is a comprehensive survey of the literature surrounding star-critical Ramsey numbers. First defined by Jonelle Hook in her 2010 dissertation, these numbers aim to measure the sharpness of the corresponding Ramsey numbers by determining the minimum number of edges needed to be added to a critical graph for the Ramsey property to hold. Despite being in its infancy, the topic has gained significant attention among Ramsey theorists. This work provides researchers and students with a resource for studying known results and their complete proofs. It covers typical results, including multicolor star-critical Ramsey numbers for complete graphs, trees, cycles, wheels, and n-good graphs, among others. The proofs are streamlined and, in some cases, simplified, with a few new results included. The book also explores the connection between star-critical Ramsey numbers and deleted edge numbers, which focus on destroying the Ramsey property by removing edges. The book concludes with open problems and conjectures for researchers to consider, making it a valuable resource for those studying the field of star-critical Ramsey numbers. | ||
| 532 | 8 | |a Accessibility summary: This PDF does Not fully comply with PDF/UA standards but does include limited screen reader support, descriptions for Non-text content (such as images and graphs), bookmarks for easy navigation, and searchable, selectable text. Users of assistive technologies may experience difficulty navigating or interpreting content in this document. We recognise the importance of accessibility and welcome queries about accessibility for any of our products. If you have a question or an access need, please get in touch with us via https://www.springernature.com/gp/info/accessibility | |
| 532 | 8 | |a Inaccessible, or known limited accessibility | |
| 532 | 8 | |a No reading system accessibility options actively disabled | |
| 532 | 8 | |a Publisher contact for further accessibility information: accessibilitysupport@springernature.com | |
| 588 | |a Print version record. | ||
| 650 | 0 | |a Graph theory. | |
| 650 | 1 | 4 | |a Graph Theory. |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9783031299803 |
| 776 | 0 | 8 | |i Printed edition: |z 9783031299827 |
| 830 | 0 | |a SpringerBriefs in Mathematics, |x 2191-8201 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-031-29981-0 |
| 912 | |a ZDB-2-SMA | ||
| 912 | |a ZDB-2-SXMS | ||
| 950 | |a Mathematics and Statistics (SpringerNature-11649) | ||
| 950 | |a Mathematics and Statistics (R0) (SpringerNature-43713) | ||