On the p-Edge Clique over Nuber of Complete Bipartite Graphs

DOI10.1137/0405043zbMath0773.05067OpenAlexW2314136005MaRDI QIDQ4030192

Michael S. Jacobson

Publication date: 1 April 1993

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0405043

zbMATH Keywords

digraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique ⋮ \(p\)-competition graphs

This page was built for publication: On the p-Edge Clique over Nuber of Complete Bipartite Graphs