The intersection problem for star designs
If \(G\) is a simple graph without isolated vertices, \(B\) is called a \(G\)-design if \(B\) is a finite set of graphs, each isomorphic to \(G\), with the property that for every pair \(u,v\) of vertices in the union of their vertex set, there is at most one graph in \(B\) of which \(uv\) is an edge. If \(H\) is the union of the graphs in \(B\), \(B\) is called a \(G\)-design on \(H\), so \(E(H)=| B| E(G)\). If \(B\) is a \(G\)-design on the complete graph \(K_n\), then \(B\) is called a \(G\)-design of order \(n\). The spectrum problem for \(G\) is the problem of determining Spec(\(G\)), the set of all \(n\) for which there is a \(G\)-design of order \(n\). The intersection problem for \(G\) is the problem of determining for all \(n\in \) Spec(\(G\)), the set of all \(k\) for which there are \(G\)-designs \(B_1\) and \(B_2\), on the same vertex set, with \(| B_1 \cap B_2| =k\). The authors determine those triples \((m,n,k)\) of integers for which there are two \(m\)-star designs on the same \(n\)-set having exacatly \(k\) stars in common.
- Orthogonal decomposition and packing of complete graphs
- Intersecting designs
- The volume and foundation of star trades
- The triangle intersection problem for G-designs
- scientific article; zbMATH DE number 3857827 (Why is no real title available?)
- On a problem of Eric Mendelsohn on edge-intersections of graphs
- scientific article; zbMATH DE number 825145 (Why is no real title available?)
- On the volume of -way G-trade
This page was built for publication: The intersection problem for star designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377722)
