Partial triple systems and edge colourings

DOI10.1016/0012-365X(86)90117-2MaRDI QIDQ1109776zbMATH OpenFDO

Authors Alan Hartman

Publication date 1986

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(86)90117-2

zbMATH Keywords

complete graphmaximum partial triple systemminimum edge-colouringsMPTpartial triple systemPT

Mathematics Subject Classification ID

Triple systems (05B07) Coloring of graphs and hypergraphs (05C15)

Review text

A partial triple system of order v, PT(v), is a pair (V,B) where V is a v-set, and B is a collection of 3-subsets of V (called triples) such that each 2-subset of V is contained in at most one triple. A maximum partial triple system of order v, MPT(v), is a PT(v), (V,B), such that for any other PT(v), (V,C), we have \(| C| \leq | B|\). Several authors have considered the problem of embedding PT(v) and MPT(v) in systems of higher order. We complete the proof, begun by Mendelsohn and Rosa, that an MPT(u) can be embedded in an MPT(v) where v is the smallest value in each congruence class mod 6 with \(v\geq 2u\). We also consider a general problem concerning transversals of minimum edge-colourings of the complete graph.

Recommendations

• Publication:3201072
• The strong chromatic number of partial triple systems
• On the edge-coloring property for Hanani triple systems
• On colorful edge triples in edge-colored complete graphs
• Color sets of tripartite graphs
• On colourings of Steiner triple systems
• Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems
• The edge-coloring-property for Steiner triple systems
• scientific article; zbMATH DE number 2061154

Cites work

• scientific article; zbMATH DE number 3847402 (Why is no real title available?)
• scientific article; zbMATH DE number 3891382 (Why is no real title available?)
• scientific article; zbMATH DE number 3737686 (Why is no real title available?)
• scientific article; zbMATH DE number 3788634 (Why is no real title available?)
• One-factorizations of the complete graph—A survey
• Parallel concepts in graph theory

Cited in

(9)

• The strong chromatic number of partial triple systems
• On a class of completable partial edge-colourings
• The total chromatic number of regular graphs whose complement is bipartite
• Two Doyen-Wilson theorems for maximum packings with triples
• The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles
• Embeddings of partial Steiner triple systems
• Embeddings of maximum packings in triple systems
• scientific article; zbMATH DE number 4177083 (Why is no real title available?)
• scientific article; zbMATH DE number 3847402 (Why is no real title available?)

This page was built for publication: Partial triple systems and edge colourings

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