Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/dm/GyoriMSTV18
%A Györi, Ervin
%A Methuku, Abhishek
%A Salia, Nika
%A Tompkins, Casey
%A Vizer, Máté
%D 2018
%J Discrete Mathematics
%K dblp
%N 9
%P 2602-2605
%T On the maximum size of connected hypergraphs without a path of given length.
%U http://dblp.uni-trier.de/db/journals/dm/dm341.html#GyoriMSTV18
%V 341
@article{journals/dm/GyoriMSTV18,
added-at = {2018-07-31T00:00:00.000+0200},
author = {Györi, Ervin and Methuku, Abhishek and Salia, Nika and Tompkins, Casey and Vizer, Máté},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/267ac82a34ad700bac76a75e5d8d21ac7/dblp},
ee = {https://doi.org/10.1016/j.disc.2018.06.006},
interhash = {227e34edc9f0e9d73930a085ef1455df},
intrahash = {67ac82a34ad700bac76a75e5d8d21ac7},
journal = {Discrete Mathematics},
keywords = {dblp},
number = 9,
pages = {2602-2605},
timestamp = {2019-09-27T11:19:54.000+0200},
title = {On the maximum size of connected hypergraphs without a path of given length.},
url = {http://dblp.uni-trier.de/db/journals/dm/dm341.html#GyoriMSTV18},
volume = 341,
year = 2018
}