Tournaments, 4-uniform hypergraphs, and an exact extremal result
From MaRDI portal
Publication:2399352
DOI10.1016/j.jctb.2017.04.001zbMath1368.05059arXiv1509.03268OpenAlexW2963019463MaRDI QIDQ2399352
Jason Semeraro, Karen Gunderson
Publication date: 22 August 2017
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.03268
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20)
Related Items
Tournaments, 4-uniform hypergraphs, and an exact extremal result ⋮ Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ⋮ Matricial characterization of tournaments with maximum number of diamonds
Uses Software
Cites Work
- A problem of Erdős and Sós on 3-graphs
- New Turán densities for 3-graphs
- Turán \(H\)-densities for 3-graphs
- An exact result for 3-graphs
- 3-designs from \(\text{PSL}(2,q)\)
- Some graphs related to the small Mathieu groups
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Some Ramsey-Turán type results for hypergraphs
- Exact solution of some Turán-type problems
- Cohomological aspects of two-graphs
- On hypergraphs with every four points spanning at most two triples
- Automorphisms and enumeration of switching classes of tournaments
- Transversal numbers of uniform hypergraphs
- On Ramsey - Turan type theorems for hypergraphs
- Two-graphs and skew two-graphs in finite geometries
- Tournaments, 4-uniform hypergraphs, and an exact extremal result
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\)
- \(3\)-designs from PGL\((2,q)\)
- Vertex-transitive self-complementary uniform hypergraphs
- On 3-Hypergraphs with Forbidden 4-Vertex Configurations
- Hypergraphs Do Jump
- Quasi-random hypergraphs
- An Exact Result for Hypergraphs and Upper Bounds for the Turán Density of $K^r_{r+1}$
- Regular 2-Graphs
- Large sets of 3‐designs from psl(2, q), with block sizes 4 and 5
- On t-Designs and Groups
- Upper bounds for Turán numbers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
