Boolean combinations of graphs
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916543641681920 |
|---|---|
| author | Adenwalla, Sarosh Braunfeld, Samuel Sylvester, John Zamaraev, Viktor |
| author_facet | Adenwalla, Sarosh Braunfeld, Samuel Sylvester, John Zamaraev, Viktor |
| contents | Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea applied to graphs. In order to understand expressive power and limitations of boolean combinations in this context, we investigate how they affect different combinatorial and structural properties of graphs, in particular $χ$-boundedness, as well as characterize the structure of boolean combinations of graphs from various classes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_19551 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Boolean combinations of graphs Adenwalla, Sarosh Braunfeld, Samuel Sylvester, John Zamaraev, Viktor Combinatorics Discrete Mathematics 05C75, 05C62, 68R10, 06E30 G.2.2 Boolean combinations allow combining given combinatorial objects to obtain new, potentially more complicated, objects. In this paper, we initiate a systematic study of this idea applied to graphs. In order to understand expressive power and limitations of boolean combinations in this context, we investigate how they affect different combinatorial and structural properties of graphs, in particular $χ$-boundedness, as well as characterize the structure of boolean combinations of graphs from various classes. |
| title | Boolean combinations of graphs |
| topic | Combinatorics Discrete Mathematics 05C75, 05C62, 68R10, 06E30 G.2.2 |
| url | https://arxiv.org/abs/2412.19551 |