Extremal connectivity for topological cliques in bipartite graphs

From MaRDI portal
Publication:2581501

DOI10.1016/J.JCTB.2005.06.005zbMATH Open1080.05044OpenAlexW2017119382MaRDI QIDQ2581501FDOQ2581501


Authors: Deryk Osthus, Daniela Kühn Edit this on Wikidata


Publication date: 10 January 2006

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2005.06.005




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Extremal connectivity for topological cliques in bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581501)