Work

Regular Subgraphs of Linear Hypergraphs

Year: 2024

Type: article

Abstract: We prove that the maximum number of edges in a 3-uniform linear hypergraph on vertices containing no 2-regular subhypergraph is n^1+o(1). This resolves a conjecture of Dellamonica, Haxell, Łuczak, Mubayi, Nagle, Person, Rödl, Schacht, and Verstraëte. We use this result to show that the maximum number of edges in a 3-uniform hypergraph on vertices containing no immersion of a closed surface is n^2+o(1). Furthermore, we present results on the maximum number of edges in -uniform linear hypergraphs containing no r-regular subhypergraph.

Source: Repository for Publications and Research Data (ETH Zurich)

DOI: 10.3929/ethz-b-000688235

Authors: Janzer, Oliver, Sudakov, Benny, Tomon, István

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W6928693752

FWCI:

Cites:

Cited by:

Related to: