human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "List coloring triangle-free hypergraphs"
  Abstract: A triangle in a hypergraph is a collection of distinct vertices u, v, w and distinct edges e, f, g with , and . Johansson [Tech. report (1996)] proved that every triangle-free graph with maximum degree Δ has list chromatic number . Frieze and Mubayi (Electron J Comb 15 (2008), 27) proved that every linear (meaning that every two edges share at most one vertex) triangle-free triple system with maximum degree Δ has chromatic number . The restriction to linear triple systems was crucial to their proof.



We provide a common generalization of both these results for rank 3 hypergraphs (edges have size 2 or 3). Our result removes the linear restriction from [8], while reducing to the (best possible) result [Johansson, Tech. report (1996)] for graphs. In addition, our result provides a positive answer to a restricted version of a question of Ajtai Erdős, Komlos, and Szemeredi (combinatorica 1 (1981), 313–317) concerning sparse 3-uniform hypergraphs.



As an application, we prove that if is the collection of 3-uniform triangles, then the Ramsey number satisfies 






for some positive constants a and b. The upper bound makes progress towards the recent conjecture of Kostochka, Mubayi, and Verstraete (J Comb Theory Ser A 120 (2013), 1491–1507) that where C3 is the linear triangle. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 487–519, 2015

Connected through hyperedge HE-1 (induced by source paper "Sparse hypergraphs with low independence number"):
  with members:
    (none)

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Mathematics