{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/98536"},"canonical_url":"https://search.dev.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/98536","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"On the Discrete Number of Tree Graphs","abstract":"We study a generalization of the problem of finding bounds on the number of discrete chains, which itself is a generalization of the Erdős unit distance problem. Given a set of points in Euclidean space and a tree graph consisting of a much smaller number of vertices, we study the maximum possible number of tree graphs which can be represented by a prescribed tree graph. We derive an algorithm for finding tight bounds for this family of problems up to chain bound discrepancy, and give upper and lower bounds in special cases.","abstract_html":"We study a generalization of the problem of finding bounds on the number of discrete chains, which itself is a generalization of the Erdős unit distance problem. Given a set of points in Euclidean space and a tree graph consisting of a much smaller number of vertices, we study the maximum possible number of tree graphs which can be represented by a prescribed tree graph. We derive an algorithm for finding tight bounds for this family of problems up to chain bound discrepancy, and give upper and lower bounds in special cases.","abstract_has_math":false,"creators":["Rhodes, Benjamin Robert"],"institution":"Virginia Tech","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Mathematics","degree_department":"Mathematics","school":null,"contributors":[],"advisors":[],"committee_chairs":["Palsson, Eyvindur Ari"],"committee_members":["Senger, Steven M.","Fraas, Martin"],"year":2020,"date_issued":"2020-05-22","date_published":"2020-05-22","updated_at":"2026-07-22T22:18:52Z","subjects":["tree graphs","distance problem","bounds"],"languages":[],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["vt_gsexam:25577"],"render_values":[{"text":"vt_gsexam:25577","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/10919/98536","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.committeechair","label":"Committee Chair","values":["Palsson, Eyvindur Ari"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Senger, Steven M.","Fraas, Martin"]},{"key":"dc:contributor.department","label":"Department","values":["Mathematics"]},{"key":"dc:creator","label":"Author","values":["Rhodes, Benjamin Robert"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2020-05-23T08:00:24Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2020-05-23T08:00:24Z"]},{"key":"dc:date.issued","label":"Date","values":["2020-05-22"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["tree graphs","distance problem","bounds"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["vt_gsexam:25577"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/98536"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We study a generalization of the problem of finding bounds on the number of discrete chains, which itself is a generalization of the Erdős unit distance problem. Given a set of points in Euclidean space and a tree graph consisting of a much smaller number of vertices, we study the maximum possible number of tree graphs which can be represented by a prescribed tree graph. We derive an algorithm for finding tight bounds for this family of problems up to chain bound discrepancy, and give upper and lower bounds in special cases."]},{"key":"dc:description.abstractgeneral","label":"General Abstract","values":["We study a generalization of the problem of finding bounds on the number of discrete chains, which itself is a generalization of the Erdős unit distance problem, a famous mathematics problem named after mathematician Paul Erdős. Given a set of points, and a tree graph of a much smaller amount of vertices, we study the maximum possible number of tree graphs which can be represented by a prescribed tree graph. We derive an algorithm for finding tight bounds for this family of problems up to chain bound discrepancy, and give upper and lower bounds in special cases."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["ETD"]},{"key":"dc:title","label":"Title","values":["On the Discrete Number of Tree Graphs"]}]}],"canonical_facts":{"dc:contributor.committeechair":["Palsson, Eyvindur Ari"],"dc:contributor.committeemember":["Senger, Steven M.","Fraas, Martin"],"dc:contributor.department":["Mathematics"],"dc:creator":["Rhodes, Benjamin Robert"],"dc:date.accessioned":["2020-05-23T08:00:24Z"],"dc:date.available":["2020-05-23T08:00:24Z"],"dc:date.issued":["2020-05-22"],"dc:description.abstract":["We study a generalization of the problem of finding bounds on the number of discrete chains, which itself is a generalization of the Erdős unit distance problem. Given a set of points in Euclidean space and a tree graph consisting of a much smaller number of vertices, we study the maximum possible number of tree graphs which can be represented by a prescribed tree graph. We derive an algorithm for finding tight bounds for this family of problems up to chain bound discrepancy, and give upper and lower bounds in special cases."],"dc:description.abstractgeneral":["We study a generalization of the problem of finding bounds on the number of discrete chains, which itself is a generalization of the Erdős unit distance problem, a famous mathematics problem named after mathematician Paul Erdős. Given a set of points, and a tree graph of a much smaller amount of vertices, we study the maximum possible number of tree graphs which can be represented by a prescribed tree graph. We derive an algorithm for finding tight bounds for this family of problems up to chain bound discrepancy, and give upper and lower bounds in special cases."],"dc:description.degree":["Master of Science"],"dc:format.medium":["ETD"],"dc:identifier.other":["vt_gsexam:25577"],"dc:identifier.uri":["http://hdl.handle.net/10919/98536"],"dc:publisher":["Virginia Tech"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject":["tree graphs","distance problem","bounds"],"dc:title":["On the Discrete Number of Tree Graphs"],"dc:type":["Thesis"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-07-22T22:18:52Z"}