Back to results
University of Illinois at Urbana-Champaign
Five Topics in Extremal and Structural Graph Theory
Abstract
dc:descriptionThe Friendship Theorem states that if G is a graph in which every two vertices have exactly one common neighbor, then G has a dominating vertex. Sos defined an analogous friendship property for 3-uniform hypergraphs, and constructed a family satisfying it. We present additional 3-uniform hypergraphs on 8, 16, and 32 vertices that satisfy this property that were obtained using integer programming. No examples outside the family construct by Sos were previously known.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2015
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Vandenbussche, Jennifer
- Contributors dc:contributor
-
- Kostochka, Alexandr
Subjects
dc:subject × 1Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- (MiAaPQ)AAI3314922
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/86904