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

DOI10.1016/J.TCS.2016.05.027zbMATH Open1342.05089OpenAlexW2962899930MaRDI QIDQ5890720FDOQ5890720

Authors: Marina Groshaus, Leandro Montero 

Publication date: 1 June 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.027

Recommendations

• Tight lower bounds on the number of bicliques in false-twin-free graphs
• Bicliques in graphs. I: Bounds on their number
• On Independent Sets and Bicliques in Graphs
• On independent sets and bicliques in graphs
• Bicliques and eigenvalues

zbMATH Keywords

lower boundsbicliquesfalse-twin-free graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Algorithm Theory - SWAT 2004
• On Independent Sets and Bicliques in Graphs
• Bicliques in graphs. I: Bounds on their number
• Algorithm Theory - SWAT 2004
• Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
• Generating bicliques of a graph in lexicographic order
• Consensus algorithms for the generation of all maximal bicliques
• Enumeration aspects of maximal cliques and bicliques
• On the iterated biclique operator
• Arboricity and bipartite subgraph listing algorithms
• Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
• Tight lower bounds on the number of bicliques in false-twin-free graphs

Cited In (3)

• Bicliques in graphs. I: Bounds on their number
• Tight lower bounds on the number of bicliques in false-twin-free graphs
• Diclique digraphs

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

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