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

DOI10.1007/BF01302966zbMath0813.05055OpenAlexW2064150325MaRDI QIDQ1343169

Myung S. Chung, Douglas B. West

Publication date: 1 February 1995

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01302966

zbMATH Keywords

complete bipartite graphcliqueintersection numberorthogonal double covering

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of mathematical programming (90C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

Overlap number of graphs ⋮ New type of coding problem motivated by database theory ⋮ Tree representations of graphs ⋮ Intersection representation of complete unbalanced bipartite graphs ⋮ Forbidden induced subgraphs for bounded \(p\)-intersection number ⋮ Orthogonal double covers of general graphs. ⋮ Kneser Ranks of Random Graphs and Minimum Difference Representations ⋮ \(p\)-competition graphs ⋮ On set intersection representations of graphs ⋮ Design type problems motivated by database theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(p\)-competition numbers
• Tolerance graphs
• Minimum matrix representation of closure operations
• Near perfect coverings in graphs and hypergraphs
• Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
• Matchings and covers in hypergraphs
• On minimum matrix representation of closure operations
• Block Designs with Cyclic Block Structure
• General results on tolerance intersection graphs
• 2-Competition Graphs
• On the p-Edge Clique over Nuber of Complete Bipartite Graphs
• The Representation of a Graph by Set Intersections

This page was built for publication: The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique