Let H ( V , E ) be a finite hypergraph with vertex set V and edge set E such that every hyperedge is non-empty. Two disjoint sets A , B ⊂ V form a transversal coalition in H , if neither of them is a transversal, but their union A ∪ B is a transversal. A vertex partition Ψ = { V 1 , V 2 , … , V p } is a transversal coalition partition, if none of the partition classes is a transversal, meanwhile for every i ∈ { 1 , 2 , … , p } there exists a distinct j ∈ { 1 , 2 , … , p } such that V i and V j form a transversal coalition. The maximum cardinality of a transversal coalition partition of H is the transversal coalition number of H and is denoted by C τ ( H ) . We generalize the previous upper bounds of Barát and Blázsik on the total coalition number by using the open neighborhood hypergraph construction. This connection was recently pointed out by Henning and Yeo and they proved similar upper bounds on the transversal coalition number for k -uniform hypergraphs. We also generalize their results by omitting the uniformity constraint. We give upper bounds in terms of the minimum and maximum size of the hyperedges. We further investigate this optimal case and study the transversal coalition graph. We prove that the possible optimal transversal coalition graphs are exactly the same as the optimal total coalition graphs. We show that every graph can be realized as a transversal coalition graph.