Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929608531640320 |
|---|---|
| author | Calbet, Asier |
| author_facet | Calbet, Asier |
| contents | We say that two vertices are twins if they have the same neighbourhood and that a graph is $K_r$-saturated if it does not contain $K_r$ but adding any new edge to it creates a $K_r$. In 1964, Erdős, Hajnal and Moon showed that $sat(n,K_r)=(r-2)n+o(n)$ for $r \geq 3$, where $sat(n,K_r)$ is the minimum number of edges in a $K_r$-saturated graph on $n$ vertices, and determined the unique extremal graph. This graph has many twins, leading us to define $tsat(n,K_r)$ to be the minimum number of edges in a twin-free $K_r$-saturated graph on $n$ vertices. We show that $(5 +2/3)n + o(n) \leq tsat(n,K_3) \leq 6n+o(n)$ and that $\left(r+2\right)n + o(n) \leq tsat(n,K_r) \leq (r+3)n+o(n)$ for $r \geq 4$. We also consider a variant of this problem where we additionally require the graphs to have large minimum degree. Both of these problems turn out be intimately related to two other problems regarding maximally independent sets of a given size in $K_3$-free graphs and generalisations of these problems to $K_r$ with $r \geq 4$. The first problem is to maximise the number of maximally independent sets given the number of vertices and the second problem is to minimise the number of edges given the number of maximally independent sets. They are interesting in their own right. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_19267 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs Calbet, Asier Combinatorics 05C35 We say that two vertices are twins if they have the same neighbourhood and that a graph is $K_r$-saturated if it does not contain $K_r$ but adding any new edge to it creates a $K_r$. In 1964, Erdős, Hajnal and Moon showed that $sat(n,K_r)=(r-2)n+o(n)$ for $r \geq 3$, where $sat(n,K_r)$ is the minimum number of edges in a $K_r$-saturated graph on $n$ vertices, and determined the unique extremal graph. This graph has many twins, leading us to define $tsat(n,K_r)$ to be the minimum number of edges in a twin-free $K_r$-saturated graph on $n$ vertices. We show that $(5 +2/3)n + o(n) \leq tsat(n,K_3) \leq 6n+o(n)$ and that $\left(r+2\right)n + o(n) \leq tsat(n,K_r) \leq (r+3)n+o(n)$ for $r \geq 4$. We also consider a variant of this problem where we additionally require the graphs to have large minimum degree. Both of these problems turn out be intimately related to two other problems regarding maximally independent sets of a given size in $K_3$-free graphs and generalisations of these problems to $K_r$ with $r \geq 4$. The first problem is to maximise the number of maximally independent sets given the number of vertices and the second problem is to minimise the number of edges given the number of maximally independent sets. They are interesting in their own right. |
| title | Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs |
| topic | Combinatorics 05C35 |
| url | https://arxiv.org/abs/2411.19267 |