Győri, Ervin and Methuku, Abhishek and Salia, N. and Tompkins, Casey and Vizer, Máté (2018) On the maximum size of connected hypergraphs without a path of given length. DISCRETE MATHEMATICS, 341 (9). pp. 2602-2605. ISSN 0012-365X
|
Text
1710.08364v1.pdf Download (125kB) | Preview |
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | connected; Erdős–Gallai; Berge hypergraph; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 12 Jan 2019 14:56 |
| Last Modified: | 12 Jan 2019 14:56 |
| URI: | http://real.mtak.hu/id/eprint/89781 |
Actions (login required)
![]() |
Edit Item |




