On the jumping constant conjecture for multigraphs

DOI10.1016/0097-3165(95)90057-8zbMath0817.05032OpenAlexW2084780007WikidataQ123104288 ScholiaQ123104288MaRDI QIDQ1345881

Vojtěch Rödl, Alexander Sidorenko

Publication date: 23 July 1995

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(95)90057-8

zbMATH Keywords

densitymultigraphsjumping constant conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

Co-degree density of hypergraphs ⋮ Turán problems for integer-weighted graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• Hypergraphs do not jump
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• Boundedness of optimal matrices in extremal multigraph and digraph problems
• Extremal problems for directed graphs
• Algorithmic Solution of Extremal Digraph Problems
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Metric Spaces and Positive Definite Functions
• On the structure of linear graphs

This page was built for publication: On the jumping constant conjecture for multigraphs