On the jumping constant conjecture for multigraphs
Let \(\mathcal D\) be an infinite family of multigraphs with multiplicity of edges not exceeding \(q\), and let \(\mathcal D\) be closed under taking subgraphs. The density \(\tau({\mathcal D})\) of the family \(\mathcal D\) is given by \[ \tau({\mathcal D})= \lim_{n\to \infty} {\max\{| E(G)|: G\in {\mathcal D}\text{ and }| V(G)|= n\}\over {n\choose 2}}. \] \textit{W. G. Brown}, \textit{P. Erdős} and \textit{M. Simonovits} [J. Comb. Theory, Ser. B 15, 77-93 (1973; Zbl 0253.05124)] conjectured that the set of all possible densities of \(\mathcal D\) is well ordered. In the paper under review the conjecture is disproved for all \(q\geq 4\).
- Algorithmic Solution of Extremal Digraph Problems
- Boundedness of optimal matrices in extremal multigraph and digraph problems
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
- Extremal problems for directed graphs
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- scientific article; zbMATH DE number 3189017 (Why is no real title available?)
- Hypergraphs do not jump
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Metric Spaces and Positive Definite Functions
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- On the structure of linear graphs
- Co-degree density of hypergraphs
- Jumps and nonjumps in multigraphs
- Turán problems for integer-weighted graphs
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- scientific article; zbMATH DE number 1554939 (Why is no real title available?)
- On a conjecture of Nagy on extremal densities
This page was built for publication: On the jumping constant conjecture for multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1345881)
