|
Domination in subcubic graphs: swapping numbers| title | Domination in subcubic graphs: swapping numbers |
|---|
| start_date | 2024/04/16 |
|---|
| schedule | 10h |
|---|
| online | no |
|---|
| location_info | Salle S3 351, bât. Sciences 3 |
|---|
| summary | In 1996, Bruce Reed worked on domination in cubic graphs, and came to the conclusion that 1/3 of the vertices should suffice in dominating connected cubic graphs. Things are not that simple as there are some counter-examples, but the problem still attracted attention (and gave birth to conjectures). In 2008, Lowenstein and Rautenbach made a relatively short paper (almost 9 pages) proving that the bound holds for graphs with girth 83. After coming back on any graph theoretical concept necessary to understand the proof, I will present how to swap this two numbers, i.e. how to prove that the bound holds for graph of girth 9 in a 83 pages paper… |
|---|
| responsibles | Grandjean |
|---|
Workflow history| from state (1) | to state | comment | date |
|---|
| submitted | published | | 2024/04/16 08:57 UTC |
| |
|