Tournaments, 4-uniform hypergraphs, and an exact extremal result
From MaRDI portal
Publication:2399352
Abstract: We consider -uniform hypergraphs with the maximum number of hyperedges subject to the condition that every set of vertices spans either or exactly hyperedges and give a construction, using quadratic residues, for an infinite family of such hypergraphs with the maximum number of hyperedges. Baber has previously given an asymptotically best-possible result using random tournaments. We give a connection between Baber's result and our construction via Paley tournaments and investigate a `switching' operation on tournaments that preserves hypergraphs arising from this construction.
Recommendations
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- 3-uniform hypergraphs: modular decomposition and realization by tournaments
- Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
- Perfect matchings in 4-uniform hypergraphs
- Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\)
Cites work
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 3843786 (Why is no real title available?)
- scientific article; zbMATH DE number 3745240 (Why is no real title available?)
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 2152953 (Why is no real title available?)
- scientific article; zbMATH DE number 863501 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3185004 (Why is no real title available?)
- 3-designs from \(\text{PSL}(2,q)\)
- An exact result for 3-graphs
- An exact result for hypergraphs and upper bounds for the Turán density of \(K^r_{r+1}\)
- Automorphisms and enumeration of switching classes of tournaments
- Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\)
- Cohomological aspects of two-graphs
- Exact solution of some Turán-type problems
- Hypergraphs do jump
- Large sets of 3‐designs from psl(2, q), with block sizes 4 and 5
- New Turán densities for 3-graphs
- On 3-hypergraphs with forbidden 4-vertex configurations
- On Ramsey - Turan type theorems for hypergraphs
- On hypergraphs with every four points spanning at most two triples
- On t-Designs and Groups
- Quasi-random hypergraphs
- Regular 2-Graphs
- Some Ramsey-Turán type results for hypergraphs
- Some graphs related to the small Mathieu groups
- The CRC handbook of combinatorial designs
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- Tournaments, 4-uniform hypergraphs, and an exact extremal result
- Transversal numbers of uniform hypergraphs
- Turán \(H\)-densities for 3-graphs
- Two-graphs and skew two-graphs in finite geometries
- Upper bounds for Turán numbers
- Vertex-transitive self-complementary uniform hypergraphs
- \(3\)-designs from PGL\((2,q)\)
Cited in
(10)- Lower bounds on Tuza constants for transversals in linear uniform hypergraphs
- scientific article; zbMATH DE number 4039950 (Why is no real title available?)
- Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\)
- Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
- Turán numbers and switching
- Turán numbers of \(r\)-graphs on \(r + 1\) vertices
- The interchange graphs of tournaments with minimum score vectors are exactly hypercubes
- Matricial characterization of tournaments with maximum number of diamonds
- 3-uniform hypergraphs: modular decomposition and realization by tournaments
- Tournaments, 4-uniform hypergraphs, and an exact extremal result
This page was built for publication: Tournaments, 4-uniform hypergraphs, and an exact extremal result
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399352)
