The intersection number of complete r-partite graphs

DOI10.1515/DMA.2008.015zbMath1200.05141OpenAlexW2081019844MaRDI QIDQ3184531

N. S. Bolshakova

Publication date: 21 October 2009

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

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

zbMATH Keywords

intesectiion numberpseudo orthogonal Latin square

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

$k$-однородные латинские квадраты, их трансверсали и условие псевдоортогональности;$k$-homogeneous Latin Squares, their transversals and condition of pseudo-orthogonality ⋮ Pseudo orthogonal Latin squares

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 the intersection number of a graph
• The Representation of a Graph by Set Intersections
• Families of Non-disjoint subsets

This page was built for publication: The intersection number of complete r-partite graphs