Title of Presentation

Decompositions of complete multipartite hypergraphs

Type of Submission

Event

Faculty Advisor

Dan Roberts

Graduation Year

2020

Location

Room E102, Center for Natural Sciences, Illinois Wesleyan University

Start Date

4-4-2020 11:00 AM

End Date

4-4-2020 11:15 AM

Disciplines

Education | Mathematics

Abstract

A hypergraph is a generalization of a graph in which edges are allowed to have more than two vertices. In particular, a uniform hypergraph is a hypergraph in which each edge has the same number of vertices. A common problem in graph theory is to decompose a large graph into disjoint copies of a smaller graph. Our work extends this notion to hypergraphs. Here, we present a new technique for decomposing multipartite hypergraph.

This document is currently not available here.

Share

COinS
 
Apr 4th, 11:00 AM Apr 4th, 11:15 AM

Decompositions of complete multipartite hypergraphs

Room E102, Center for Natural Sciences, Illinois Wesleyan University

A hypergraph is a generalization of a graph in which edges are allowed to have more than two vertices. In particular, a uniform hypergraph is a hypergraph in which each edge has the same number of vertices. A common problem in graph theory is to decompose a large graph into disjoint copies of a smaller graph. Our work extends this notion to hypergraphs. Here, we present a new technique for decomposing multipartite hypergraph.