The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm
From MaRDI portal
Publication:4611853
DOI10.17951/a.2018.72.2.9zbMath1403.05105OpenAlexW2933667225WikidataQ128138044 ScholiaQ128138044MaRDI QIDQ4611853
Kamil Powroźnik, Halina Bielak
Publication date: 22 January 2019
Published in: Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17951/a.2018.72.2.9
Hypergraphs (05C65) Transversal (matching) theory (05D15) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A multipartite version of the Turan problem - density conditions and eigenvalues
- Density conditions for triangles in multipartite graphs
- Independent transversals in \(r\)-partite graphs
- Extremal problems for directed graphs
- The Density Turán Problem
- The minimal density of triangles in tripartite graphs
- Complete Subgraphs of r-partite Graphs
This page was built for publication: The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm
