Maximum chordal subgraphs of random graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929597280419840 |
|---|---|
| author | Krivelevich, Michael Zhukovskii, Maksim |
| author_facet | Krivelevich, Michael Zhukovskii, Maksim |
| contents | We find asymptotics of the maximum size of a chordal subgraph in a binomial random graph $G(n,p)$, for $p=\mathrm{const}$ and $p=n^{-α+o(1)}$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_08944 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Maximum chordal subgraphs of random graphs Krivelevich, Michael Zhukovskii, Maksim Combinatorics We find asymptotics of the maximum size of a chordal subgraph in a binomial random graph $G(n,p)$, for $p=\mathrm{const}$ and $p=n^{-α+o(1)}$. |
| title | Maximum chordal subgraphs of random graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2308.08944 |