Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph

From MaRDI portal
Publication:2225397

DOI10.1016/j.ejc.2020.103185zbMath1458.05111arXiv1907.01603OpenAlexW3042915511MaRDI QIDQ2225397

Po-Shen Loh, Debsoumya Chakraborti

Publication date: 8 February 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.01603




Related Items (5)



Cites Work


This page was built for publication: Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph