Caro, Yair and Tuza, Zsolt (2020) Regular Turán numbers. AUSTRALASIAN JOURNAL OF COMBINATORICS. ISSN 1034-4942
|
Text
1911.pdf Available under License Creative Commons Attribution. Download (138kB) | Preview |
Abstract
The regular Tur´an number of a graph F, denoted by rex(n, F), is the largest number of edges in a regular graph G of order n such that G does not contain subgraphs isomorphic to F. Giving a partial answer to a recent problem raised by Gerbner et al.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 23 Sep 2020 09:49 |
| Last Modified: | 24 Apr 2023 06:51 |
| URI: | http://real.mtak.hu/id/eprint/114192 |
Actions (login required)
 |
Edit Item |
