Back to search

University of South Florida

On Some Hypergraph Coloring Algorithms

Abstract

dc:description

Of a given bipartite graph G = (V, E), it is elementary to construct a bipartition in timeO(|V |+|E|). For a given k-graph H = H(k) with k ≥ 3 fixed, Lovász proved that deciding whether H is bipartite is NP-complete. In this thesis, we consider the average running time of this problem. For that, let B_n = (B^(k))_n be the collection (family) of all bipartite k-graphs H on the fixed vertex set [n] = {1, ...., n}. We construct, of a given H ∈ B_n, a bipartition in time averaging O(n^k) over the class B_n. We provide two proofs of our result. When k = 3, this result expedites one of Person and Schacht, which it also extends to all k ≥ 3. In this thesis, we also consider another related result of Person and Schacht cast in the setting of k = 3. Let Fn be the family of [n]-vertex 3-graphs containing no copies of the Fano plane as a subhypergraph. Since the Fano plane is not bipartite, it holds that B_n ⊆ F_n, which Person and Schacht proved is nearly an equality (in a sense made precise later). They also established an algorithm which properly and minimally colors a given H ∈ F_n in time averaging O(n^5 (log n)^2) over the class F_n. We expedite this average time for the closely related concept of an optimal 2-partition [n] = X_H ∪˙ Y_H of a fixed H ∈ F_n, which minimizes over all 2-partitions [n] = X ∪˙ Y the number e_H(X) + e_H(Y ) of edges e ∈ E_H with e ⊆ X or e ⊆ Y We give an algorithm which constructs, of a given H ∈ F_n, an optimal 2-partition [n] = X_H ∪˙ Y_H of H in time averaging O(n^3) over the class F_n.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (Ph.D.)
Level thesis:degree_level
Dissertation
Discipline thesis:degree_discipline
Mathematics and Statistics
Grantor
University of South Florida
Year dc:date
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Lee, Boyoon
Contributors dc:contributor
  • Brendan Nagle, Ph.D.
  • Theodore Molla, Ph.D.
  • Brian Curtin, Ph.D.
  • Jarred Ligatti, Ph.D.

Subjects

dc:subject × 4

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.usf.edu/etd/10878

Chain of custody

source
Harvested from
University of South Florida
Base URL
digitalcommons.usf.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Lee, Boyoon. On Some Hypergraph Coloring Algorithms. Dissertation thesis, University of South Florida, 2025. https://digitalcommons.usf.edu/etd/10878