BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Pritam Majumder (Tata Institute of Fundamental Research\, Mumbai) DTSTART:20210219T093000Z DTEND:20210219T103000Z DTSTAMP:20260423T004702Z UID:ARCSIN/1 DESCRIPTION:Title: O n characterizing line graphs of hypergraphs\nby Pritam Majumder (Tata Institute of Fundamental Research\, Mumbai) as part of ARCSIN - Algebra\, Representations\, Combinatorics and Symmetric functions in INdia\n\n\nAbst ract\nA hypergraph is given by a finite set of vertices together with a co llection of its subsets\, called edges\, of that set. A hypergraph is call ed k-uniform if all its edges have the same size k. The line graph of a k- uniform hypergraph is its edge-to-vertex dual graph\, namely\, its vertice s bijectively correspond to the edges of the hypergraph and there is an ed ge between two vertices of the line graph if the corresponding edges in th e hypergraph have non zero intersection. The characterization of line grap hs of 2-uniform hypergraphs (graphs) have been extensively studied. The ch aracterization of line graphs of k-uniform hypergraphs for k>2 is poorly u nderstood. Partial results exist for linear hypergraphs (intersection of a ny two edges is at most 1 vertex). We study the problem of \ncharacterizin g line graphs of k-uniform hypergraphs with bounded pair-degree by a finit e class of forbidden subgraphs. We show that such a characterization is po ssible if we consider line graphs with certain minimum edge-degree. Time p ermitting\, we shall discuss about some other reconstruction problems for hypergraphs\, namely\, characterizing degree sequences of hypergraphs and characterizing face numbers (f-vectors) of simplicial complexes.\n LOCATION:https://researchseminars.org/talk/ARCSIN/1/ END:VEVENT END:VCALENDAR