Some Cubic Time Regularity Algorithms for Triple Systems
From MaRDI portal
Publication:6188523
DOI10.1137/21m145046xOpenAlexW4391540782WikidataQ128684938 ScholiaQ128684938MaRDI QIDQ6188523
Publication date: 7 February 2024
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m145046x
Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Triple systems (05B07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Almost all triangle-free triple systems are tripartite
- A short proof of Gowers' lower bound for the regularity lemma
- Integer and fractional packings in dense graphs
- The uniformity lemma for hypergraphs
- A tight lower bound for Szemerédi's regularity lemma
- Stability theorems for cancellative hypergraphs
- Bounds for graph regularity and removal lemmas
- A tight bound for hypergraph regularity
- Almost all triple systems with independent neighborhoods are semi-bipartite
- Hypergraph regularity and the multidimensional Szemerédi theorem
- An Algorithmic Version of the Hypergraph Regularity Method
- Regularity lemmas for hypergraphs and quasi-randomness
- On sets of integers containing k elements in arithmetic progression
- The Algorithmic Aspects of the Regularity Lemma
- An Optimal Algorithm for Checking Regularity
- Regularity properties for triple systems
- An Algorithmic Regularity Lemma for Hypergraphs
- Extremal problems on set systems
- An algorithmic hypergraph regularity lemma
- An Algorithmic Hypergraph Regularity Lemma
- Regularity Lemma for k-uniform hypergraphs
- A Wowzer-type lower bound for the strong regularity lemma
- On Triple Systems with Independent Neighbourhoods
- A new generalization of the Erdős-Ko-Rado theorem
This page was built for publication: Some Cubic Time Regularity Algorithms for Triple Systems
