TMThomas Murff
Thomas Murff
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Thomas Murff has a total of 1 co-authors. Here are the top co-authors by number of shared publications:
- Xerxes D. Arsiwalla
Wolfram Institute for Computational Foundations of Science
1 shared publication
Latest Publications
- Open Access
Upper Bounds on the Chromatic Index of Linear Hypergraphs
We address the problem of finding upper bounds on the chromatic index $q(V,E)$ of linear (and loopless) hypergraphs. The first bound we find is defined through a color-preserving group on a proper and minimally edge-colored linear hypergraph, whose orbits serve as a finer partition to the hypergraph's coloring, thereby yielding an upper bound on $q(V,E)$. The next set of theorems in this paper relates to combinatorial properties of hypergraph coloring. Our results suggest a plausible approach to solving the Berge-Füredi conjecture, providing an upper bound on the chromatic index that directly relates $q(V,E)$ and $Δ([(V,E)]_{2}) + 1$. Furthermore, we provide three sufficient conditions for the conjecture to hold within this framework, when involving the Helly property for hypergraphs.Open AccessUpper Bounds on the Chromatic Index of Linear Hypergraphs
We address the problem of finding upper bounds on the chromatic index $q(V,E)$ of linear (and loopless) hypergraphs. The first bound we find is defined through a color-preserving group on a proper and minimally edge-colored linear hypergraph, whose orbits serve as a finer partition to the hypergraph's coloring, thereby yielding an upper bound on $q(V,E)$. The next set of theorems in this paper relates to combinatorial properties of hypergraph coloring. Our results suggest a plausible approach to solving the Berge-Füredi conjecture, providing an upper bound on the chromatic index that directly relates $q(V,E)$ and $Δ([(V,E)]_{2}) + 1$. Furthermore, we provide three sufficient conditions for the conjecture to hold within this framework, when involving the Helly property for hypergraphs.