Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures

DOI10.1016/0012-365X(84)90178-XzbMATH Open0541.05035OpenAlexW1989402342MaRDI QIDQ794664FDOQ794664

Authors: William G. Brown, Miklós Simonovits 

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90178-x

Recommendations

• Extremal problems for directed graphs
• scientific article; zbMATH DE number 3908459
• Boundedness of optimal matrices in extremal multigraph and digraph problems
• Extremal problems in uniformly dense hypergraphs
• On Ramsey - Turan type theorems for hypergraphs

zbMATH Keywords

extremal densitymaximum number of oriented hyperedgesTuran type theoremsuniform directed hypergraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cites Work

• On some extremal problems on \(r\)-graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the structure of linear graphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the theory of graphs
• On the existence of triangulated spheres in 3-graphs, and related problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extremals of functions on graphs with applications to graphs and hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extremal problems for directed graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (25)

• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• 4-books of three pages
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• Extremal problems for directed graphs
• Algorithmic Solution of Extremal Digraph Problems
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• Asymptotic solution for a new class of forbidden r-graphs
• The inducibility of complete bipartite graphs
• On the algebraic and topological structure of the set of Turán densities
• On possible Turán densities
• The maximal length of a gap between \(r\)-graph Turán densities
• Extremal numbers for directed hypergraphs with two edges
• Popular distances in 3-space
• An exact Turán result for tripartite 3-graphs
• Co-degree density of hypergraphs
• On the jumping constant conjecture for multigraphs
• Variations on the theme of repeated distances
• Generating non-jumps from a known one
• Inequalities in probability theory and turán-type problems for graphs with colored vertices
• Coloring directed hypergraphs
• Turán problems for integer-weighted graphs
• Coverings of r—graphs by complete r—partite subgraphs
• Existence and uniqueness of solutions to the norm minimum problem on digraphs
• The density maximization problem in graphs
• Non-jumping Turán densities of hypergraphs

This page was built for publication: Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794664)