Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-28T15:23:55.582Z Has data issue: false hasContentIssue false
  • English
  • Français

A Disproof of the Fon-der-Flaass Conjecture

Published online by Cambridge University Press:  03 March 2004

J. ROBERT JOHNSON
J. ROBERT JOHNSON
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, UK (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

Baranyai's partition theorem states that the edges of the complete $r$-graph on $n$ vertices can be partitioned into $1$-factors provided that $r$ divides $n$. Fon-der-Flaass has conjectured that for $r=3$ such a partitioning exists with the property that any two $1$-factors are ‘far apart’ in some natural sense.

Our aim in this note is to prove that the Fon-der-Flaass conjecture is not always true: it fails for $n=12$. Our methods are based on some new ‘auxiliary’ hypergraphs.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 13 , Issue 2 , March 2004 , pp. 195 - 201
Copyright
2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)