Extremal numbers for directed hypergraphs with two edges

zbMath1392.05048MaRDI QIDQ1753023

Alex Cameron

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p56

zbMATH Keywords

Horn clausesextremal numbersdirected hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Logics of knowledge and belief (including belief change) (03B42) Classical propositional logic (03B05) Directed graphs (digraphs), tournaments (05C20) Extremal combinatorics (05D99)

Related Items (1)

Coloring directed hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On possible Turán densities
• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• Learning conjunctions of Horn clauses
• On t-designs
• Directed hypergraphs and applications
• Extremal problems for directed graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Combinatorial Problems for Horn Clauses
• On the theory of graphs

This page was built for publication: Extremal numbers for directed hypergraphs with two edges