{"id":{"repo_id":"usf","oai_identifier":"oai:digitalcommons.usf.edu:etd-12181"},"canonical_url":"https://search.ndltd.org/etd/usf/oai:digitalcommons.usf.edu:etd-12181","repository":{"repo_id":"usf","name":"University of South Florida","base_url":"https://digitalcommons.usf.edu/do/oai/"},"display":{"title":"On Some Hypergraph Coloring Algorithms","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Lee, Boyoon"],"institution":"University of South Florida","degree_name":"Doctor of Philosophy (Ph.D.)","degree_level":"Dissertation","degree_discipline":"Mathematics and Statistics","degree_department":null,"school":null,"contributors":["Brendan Nagle, Ph.D.","Theodore Molla, Ph.D.","Brian Curtin, Ph.D.","Jarred Ligatti, Ph.D."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025-06-24T07:00:00Z","date_published":"2025-06-24T07:00:00Z","updated_at":"2026-11-19T08:49:48Z","subjects":["Bipartite Hypergraphs","Regularity Lemma","Fano Plane","Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usf.edu/etd/10878","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usf.edu/etd/10878","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usf.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usf.edu%3Aetd-12181","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Brendan Nagle, Ph.D.","Theodore Molla, Ph.D.","Brian Curtin, Ph.D.","Jarred Ligatti, Ph.D."]},{"key":"dc:creator","label":"Author","values":["Lee, Boyoon"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2025-06-24T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics and Statistics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation","Ph.D."]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (Ph.D.)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of South Florida"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Bipartite Hypergraphs","Regularity Lemma","Fano Plane","Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usf.edu/etd/10878"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["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."]},{"key":"dc:title","label":"Title","values":["On Some Hypergraph Coloring Algorithms"]}]}],"canonical_facts":{"dc:contributor":["Brendan Nagle, Ph.D.","Theodore Molla, Ph.D.","Brian Curtin, Ph.D.","Jarred Ligatti, Ph.D."],"dc:creator":["Lee, Boyoon"],"dc:date":["2025-06-24T07:00:00Z"],"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."],"dc:identifier":["https://digitalcommons.usf.edu/etd/10878"],"dc:subject":["Bipartite Hypergraphs","Regularity Lemma","Fano Plane","Mathematics"],"dc:title":["On Some Hypergraph Coloring Algorithms"],"thesis:degree_discipline":["Mathematics and Statistics"],"thesis:degree_level":["Dissertation","Ph.D."],"thesis:degree_name":["Doctor of Philosophy (Ph.D.)"],"thesis:institution_name":["University of South Florida"]},"updated_at":"2026-11-19T08:49:48Z"}