In this note, we study the nonreconstructibility property through examples given by Stockmeyer (for tournaments) and Kocay (for 3-hypergraphs). Relating these examples we show how to obtain non (&1)-reconstructible ternary relations from particular non (&1)-reconstructible binary ones.
On 2-e.c. graphs, tournaments, and hypergraphs
✍ Scribed by Anthony Bonato; Kathie Cameron
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 249 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract The notion of a split coloring of a complete graph was introduced by Erdős and Gyárfás [7] as a generalization of split graphs. In this work, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two‐round game played against an
Graph orientation is a well-studied area of combinatorial optimization, one that provides a link between directed and undirected graphs. An important class of questions that arise in this area concerns orientations with connectivity requirements. In this paper we focus on how similar questions can b
It is known that the class of line graphs of linear 3-uniform hypergraphs cannot be characterized by a finite list of forbidden induced subgraphs (R. N.
Jegou, P. and M.-C. Vilarem, On some partial line graphs of a hypergraph and the associated matroid, Discrete Mathematics 111 (1993) 3333344. In this paper, we define for a hypergraph H =(X, G) a class of partial graphs of its line graph CR(H);