On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) (Q1684649): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1609.03401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turán numbers of bipartite graphs plus an odd cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many \(T\) copies in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pentagons vs. triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Results for Berge Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New asymptotics for bipartite Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-uniform hypergraphs without a cycle of a given length / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-uniform hypergraphs avoiding a given odd cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with no cycle of length 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with No Cycle of a Given Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph Extensions of the Erdős-Gallai Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hypergraphs of girth five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a linear equation in a set of integers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to sparse removal / rank
 
Normal rank

Latest revision as of 19:56, 14 July 2024

scientific article
Language Label Description Also known as
English
On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
scientific article

    Statements

    On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) (English)
    0 references
    0 references
    12 December 2017
    0 references
    Summary: Let \(\mathcal{F}\) be an \(r\)-uniform hypergraph and \(G\) be a multigraph. The hypergraph \(\mathcal{F}\) is a Berge-\(G\) if there is a bijection \(f: E(G) \rightarrow E(\mathcal{F})\) such that \(e \subseteq f(e)\) for each \(e \in E(G)\). Given a family of multigraphs \(\mathcal{G}\), a hypergraph \(\mathcal{H}\) is said to be \(\mathcal{G}\)-free if for each \(G \in \mathcal{G}\), \(\mathcal{H}\) does not contain a subhypergraph that is isomorphic to a Berge-\(G\). We prove bounds on the maximum number of edges in an \(r\)-uniform linear hypergraph that is \(K_{2,t}\)-free. We also determine an asymptotic formula for the maximum number of edges in a linear 3-uniform 3-partite hypergraph that is \(\{C_3,K_{2,3}\}\)-free.
    0 references
    hypergraph Turán problem
    0 references
    Sidon sets
    0 references
    Berge-\(K_{2,t}\)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references