Four gravity results
The concept of gravity was introduced by \textit{T.~Madaras} and \textit{R.~Škrekovski} [Discrete Math. 307, 939--951 (2007; Zbl 1111.05027)]. The gravity of a given graph \(H\) in a given family \(\mathcal H\) of graphs is the greatest integer \(n\) with the property that for every integer \(m\) there exists a supergraph \(G\in\mathcal H\) of \(H\), such that each subgraph of \(G\) isomorphic to \(H\) contains at least \(n\) vertices of degree \(\geq m\) in \(G\). T.~Madaras and R.~Škrekovski [loc. cit.] proved that the gravity of the path \(P_k\) in the family of planar graphs of minimum degree \(2\) is at most \(k - 2\) for each \(k\geq 2\), and the gravity reaches the bound of \(k - 2\) for each \(k\notin\{ 5, 7, 8, 9\}\). They conjectured that for each of the four excluded cases the gravity is \(k - 3\). The present paper is devoted to a proof of this conjecture.
- Heavy paths, light stars, and big melons
- scientific article; zbMATH DE number 4135967 (Why is no real title available?)
- scientific article; zbMATH DE number 1536529 (Why is no real title available?)
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
- Lightness, heaviness and gravity
- On \(3\)-connected plane graphs without triangular faces
- On light cycles in plane triangulations
- On light subgraphs in plane graphs of minimum degree five
- On the total coloring of planar graphs.
- On vertex-degree restricted paths in polyhedral graphs
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
This page was built for publication: Four gravity results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864159)
