Boundedness of optimal matrices in extremal multigraph and digraph problems

DOI10.1007/BF01202793zbMath0774.05051OpenAlexW2085494350MaRDI QIDQ2367447

Alexander Sidorenko

Publication date: 16 August 1993

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01202793

zbMATH Keywords

multiplicityRamsey numbersdense matricesmultigraphsstandard simplexfinite algorithmasymptotically extremal

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Ramsey theory (05D10) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

On the edit distance function of the random graph ⋮ On the jumping constant conjecture for multigraphs ⋮ Some results on Lagrangians of hypergraphs ⋮ On the Edit Distance from K2,t-Free Graphs ⋮ The edit distance function and symmetrization ⋮ On possible Turán densities ⋮ On the computation of edit distance functions ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems

Cites Work

• Unnamed Item
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• Extremal problems for directed graphs
• Inequalities in probability theory and turán-type problems for graphs with colored vertices
• Disproof of a conjecture of Erdös and moser on tournaments
• Metric Spaces and Positive Definite Functions

This page was built for publication: Boundedness of optimal matrices in extremal multigraph and digraph problems