The p-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
DOI10.1007/BF01302966zbMATH Open0813.05055OpenAlexW2064150325MaRDI QIDQ1343169FDOQ1343169
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
Applications of mathematical programming (90C90) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Near perfect coverings in graphs and hypergraphs
- Matchings and covers in hypergraphs
- 2-Competition Graphs
- General results on tolerance intersection graphs
- Tolerance graphs
- The Representation of a Graph by Set Intersections
- Minimum matrix representation of closure operations
- On minimum matrix representation of closure operations
- \(p\)-competition numbers
- Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
- Block Designs with Cyclic Block Structure
- On the p-Edge Clique over Nuber of Complete Bipartite Graphs
Cited In (11)
- On set intersection representations of graphs
- Tree representations of graphs
- A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers
- New type of coding problem motivated by database theory
- Orthogonal double covers of general graphs.
- Design type problems motivated by database theory
- Intersection representation of complete unbalanced bipartite graphs
- Forbidden induced subgraphs for bounded \(p\)-intersection number
- Overlap number of graphs
- Kneser Ranks of Random Graphs and Minimum Difference Representations
- \(p\)-competition graphs
This page was built for publication: The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1343169)
