On the intersection number of a graph

DOI10.1515/dma.2007.045zbMath1247.05193OpenAlexW2034853167MaRDI QIDQ5439076

N. S. Bolshakova, E. E. Marenich

Publication date: 8 February 2008

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.2007.045

zbMATH Keywords

graph coveringcomplete subgraphsintersection number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

The intersection number of complete r-partite graphs

Cites Work

• On the fractional intersection number of a graph
• Covering the edges of a random graph by cliques
• Clique coverings of the edges of a random graph
• On A Problem of Purdy Related to Sperner Systems
• The Representation of a Graph by Set Intersections

This page was built for publication: On the intersection number of a graph