by Jan Dreier, Philipp Kuinke, Peter Rossmanith
Reference:
Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic SizeJan Dreier, Philipp Kuinke, Peter RossmanithApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), volume 176 of LIPIcs, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Bibtex Entry:
@string{lipics="LIPIcs"}
@inproceedings{DreierKuinkeRossmanith20b,
title={Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Size},
author={Jan Dreier and Philipp Kuinke and Peter Rossmanith},
booktitle={Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
series = {LIPIcs},
volume = {176},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12617},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.14},
}