Tight lower bounds on the number of bicliques in false-twin-free graphs

DOI10.1016/j.endm.2015.07.049zbMath1347.05126arXiv1510.01165OpenAlexW2570278360MaRDI QIDQ5890936

Marina Groshaus, Leandro Montero

Publication date: 17 October 2016

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

lower boundsbicliquesfalse-twin-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Tight lower bounds on the number of bicliques in false-twin-free graphs

Cites Work

• Unnamed Item
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• On the Iterated Biclique Operator
• On Independent Sets and Bicliques in Graphs
• Bicliques in graphs. I: Bounds on their number

This page was built for publication: Tight lower bounds on the number of bicliques in false-twin-free graphs