Decomposing complete graphs into isomorphic complete multipartite graphs

DOI10.1007/978-3-031-48679-1_10zbMATH Open1548.05271MaRDI QIDQ6613355

Publication date: 2 October 2024

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

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?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Constructions of optimal difference systems of sets
Optimal difference systems of sets and partition-type cyclic difference packings
On disjoint $(v,k,k-1)$ difference families
Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families
Constructions of external difference families and disjoint difference families
Optimal constructions for ID-based one-way-function key predistribution schemes realizing specified communication graphs
Difference systems of sets and cyclotomy
Further results on the existence of splitting BIBDs and application to authentication codes
Perfect difference systems of sets and Jacobi sums
Decomposition of complete multigraphs into stars
On claw-decomposition of complete graphs and complete bigraphs
Partitions and other coverings of finite groups.
New combinatorial designs and their applications to authentication codes and secret sharing schemes.
Weighted external difference families and R-optimal AMD codes
Cyclotomic construction of strong external difference families in finite fields
New existence and nonexistence results for strong external difference families
Some results on generalized strong external difference families
On the existence of balanced bipartite designs. II
Strong external difference families in abelian and non-abelian groups
Internal and external partial difference families and cyclotomy
Existence on splitting-balanced block designs with resolvability
Near-complete external difference families
Existence and non-existence results for strong external difference families
A new class of optimal 3-splitting authentication codes
Cyclotomy and difference families in elementary Abelian groups
Construction and nonexistence of strong external difference families
High-Rate Self-Synchronizing Codes
A survey on the existence ofG-Designs
Cyclotomic constructions of external difference families and disjoint difference families
Impossibility of Decomposing the Complete Graph on n Points into $n - 1$ Isomorphic Complete Bipartite Graphs
Splitting balanced incomplete block designs with block size 3 × 2
Combinatorial Constructions for Optimal Splitting Authentication Codes
External Difference Families from Finite Fields
Decomposition of Complete Graphs into Isomorphic Complete Bipartite Graphs
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
The Coarseness of the Complete Graph
Decomposition of complete graphs into stars
Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes

This page was built for publication: Decomposing complete graphs into isomorphic complete multipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6613355)