Wine Bottle Problems

Title

Wine Bottle Problems

Authors

Files

Description

This is a project for MTH 466, Graph Theory and Combinatorics. A graph is a mathematical object that consists of two sets, a set of vertices and a set of edges. An edge joins two vertices and depicts a relationship between those vertices. Using vertices to represent states and directed edges to represent a transition between states, we can construct digraphs to model the Wine Bottle Problems. These problems ask how few pourings are needed to distribute specific amounts of wine amongst a set of unmarked bottles knowing only the capacity of each bottle and the total amount of wine. We will model problems such as finding the minimum number of pours required to distribute 8 liters of wine evenly into 2 bottles using only three bottles that have capacities of 3, 5, and 8 liters of wine. We will also explore properties of these digraphs.

Publication Date

4-24-2019

Project Designation

Course Project

Primary Advisor

Aparna W Higgins

Primary Advisor's Department

Mathematics

Keywords

Stander Symposium poster

Comments

Presenter: Daniel J Illg

Wine Bottle Problems

Share

COinS