The intersection problem for K₄-e designs
From MaRDI portal
Publication:1361653
DOI10.1016/S0378-3758(96)00056-0zbMATH Open0922.05015OpenAlexW2008656016MaRDI QIDQ1361653FDOQ1361653
Authors: Elizabeth J. Billington, Mario Gionfriddo, C. C. Lindner
Publication date: 26 August 1997
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0378-3758(96)00056-0
Recommendations
Cites Work
Cited In (15)
- Orthogonal decomposition and packing of complete graphs
- Intersecting designs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reaction graphs of the \(K_4-e\) design of order 6
- The fine triangle intersection problem for \((K_4 - e)\)-designs
- The intersection problem for graphs with six vertices, six edges and a 4-cycle subgraph
- Title not available (Why is that?)
- Intersections among Steiner systemsS(k,k+ 1,v)
- The fine triangle intersections for maximum kite packings
- The triangle intersection problem for \(K_4-e\) designs
- Blocking sets inG-designs andK3,3- designs
- Trade spectrum of \(K_{4} - e\)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: The intersection problem for \(K_4-e\) designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361653)