The k-general d-position problem for graphs
Brent Cody, Garrett Moore

TL;DR
This paper introduces the k-general d-position problem, extending the concept of general position in graphs, and provides bounds, exact values for specific graphs, and new labeling methods to analyze these sets.
Contribution
It generalizes the notion of general position to k-general d-position, develops bounds, and computes exact values for paths, cycles, and grids, introducing k-monotone-geodesic labeling.
Findings
Computed k-general d-position number for paths and cycles.
Established bounds based on subgraph properties.
Introduced k-monotone-geodesic labeling for grid analysis.
Abstract
A set of vertices of a graph is said to be in general position if no three vertices from the set lie on a common geodesic. Recently Klav\v{z}ar, Rall and Yero generalized this notion by defining a set of vertices to be in general -position if no three vertices from the set lie on a common geodesic of length at most . We generalize this notion further by defining a set of vertices to be in -general -position if no vertices of the set lie on a common geodesic of length at most . The -general -position number of a graph is the largest cardinality of a -general -position set. We provide upper and lower bounds on the -general -position number of graphs in terms of the -general -position number of certain kinds of subgraphs. We compute the -general -position number of finite paths and cycles. Along the way we establish that the maximally even…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Optimization and Packing Problems · Computational Geometry and Mesh Generation
