Une étude des graphes jumeaux via l'auto-abritement
dc.contributor.advisor | Hahn, Gena | |
dc.contributor.advisor | Seamone, Benjamin | |
dc.contributor.author | Gagnon, Alizée | |
dc.date.accessioned | 2022-11-04T18:44:48Z | |
dc.date.available | NO_RESTRICTION | fr |
dc.date.available | 2022-11-04T18:44:48Z | |
dc.date.issued | 2022-05-04 | |
dc.date.submitted | 2022-03 | |
dc.identifier.uri | http://hdl.handle.net/1866/27057 | |
dc.subject | Graphe infini | fr |
dc.subject | Abritement | fr |
dc.subject | Conjecture Alternative des Graphes | fr |
dc.subject | Conjecture de Thomassé | fr |
dc.subject | Jumeau | fr |
dc.subject | Auto-Abritement | fr |
dc.subject | Graphe Auto-Abrité | fr |
dc.subject | Graph Alternative Conjecture | fr |
dc.subject | Self-Contained Graphs | fr |
dc.subject | Twins | fr |
dc.subject | Embeddings | fr |
dc.subject | Infinite Graph | fr |
dc.subject | Self-Embedding | fr |
dc.subject.other | Mathematics / Mathématiques (UMI : 0405) | fr |
dc.title | Une étude des graphes jumeaux via l'auto-abritement | fr |
dc.type | Thèse ou mémoire / Thesis or Dissertation | |
etd.degree.discipline | Informatique | fr |
etd.degree.grantor | Université de Montréal | fr |
etd.degree.level | Maîtrise / Master's | fr |
etd.degree.name | M. Sc. | fr |
dcterms.abstract | On étudie la conjecture des graphes jumeaux dénombrables, cas spécifique d’une conjecture de Thomassé, qui dit que le nombre de jumeaux d’un graphe dénombrable ( ses sous-graphes propres desquels il est aussi un sous-graphe propre) est soit nul, soit infini. On commence par étudier les graphes auto-abrités, que nous définissons, et en utilisant notre classification de ces graphes nous prouvons la conjecture dans certains cas, en précisant la cardinalité exacte du nombre de jumeaux. Nous donnons également des contre-exemples à l’article de l’arXiv «Self-contained graphs». | fr |
dcterms.abstract | We make progress on the Graph Alternative Conjecture, a special case of a conjecture of Thomassé which says that the number of twins of a countable graph (i.e. its proper subgraphs of which that graph is also a proper subgraph) is either null or infinite. We begin by studying self-embedded graphs, which we define, and using our classification of these graphs, we prove the conjecture in some cases while specifying the exact number of twins. We also give counter-examples to a paper on arXiv called "Self-contained graphs". | fr |
dcterms.language | fra | fr |
Files in this item
This item appears in the following Collection(s)
This document disseminated on Papyrus is the exclusive property of the copyright holders and is protected by the Copyright Act (R.S.C. 1985, c. C-42). It may be used for fair dealing and non-commercial purposes, for private study or research, criticism and review as provided by law. For any other use, written authorization from the copyright holders is required.