{"id":{"repo_id":"city-london","oai_identifier":"oai:openaccess.city.ac.uk:17910"},"canonical_url":"https://search.dev.ndltd.org/etd/city-london/oai:openaccess.city.ac.uk:17910","repository":{"repo_id":"city-london","name":"City University of London","base_url":"https://openaccess.city.ac.uk/cgi/oai2"},"display":{"title":"Improving the capacity of radio spectrum: exploration of the acyclic orientations of a graph","abstract":"The efficient use of radio spectrum depends upon frequency assignment within a telecommunications network. The solution space of the frequency assignment problem is best described by the acyclic orientations of the network. An acyclic orientation Ɵ of a graph (network) G is an orientation of the edges of the graph which does not create any directed cycles. We are primarily interested in how many ways this is possible for a given graph, which is the count of the number of acyclic orientations, a(G). This is just the evaluation of the chromatic polynomial of the graph χ(G; λ) at λ = -1. Calculating (and even approximating) the chromatic polynomial is known to be #P-hard, but it is unknown whether or not the approximation at the value -1 is. There are two key contributions in this thesis. Firstly, we obtain computational results for all graphs with up to 8 vertices. We use the data to make observations on the structure of minimal and maximal graphs, by which we mean graphs with the fewest and greatest number of acyclic orientations respectively, as well as on the distribution of acyclic orientations. Many conjectures on the structure of extremal graphs arise, of which we prove some in the theoretical part of the thesis. Secondly, we present a compression move which is monotonic with respect to the number of acyclic orientations, and with respect to various other parameters in particular cliques. This move gives us a new approach to classifying all minimal graphs. It also enables us to tackle the harder problem of identifying maximal graphs. We show that certain Turán graphs are uniquely maximal (Turán graphs are complete multipartite graphs with all vertex classes as equal as possible), and conjecture that all Turán graphs are maximal. In addition we derive an explicit formula for the number of acyclic orientations of complete bipartite graphs.","abstract_html":"The efficient use of radio spectrum depends upon frequency assignment within a telecommunications network. The solution space of the frequency assignment problem is best described by the acyclic orientations of the network. An acyclic orientation Ɵ of a graph (network) G is an orientation of the edges of the graph which does not create any directed cycles. We are primarily interested in how many ways this is possible for a given graph, which is the count of the number of acyclic orientations, a(G). This is just the evaluation of the chromatic polynomial of the graph χ(G; λ) at λ = -1. Calculating (and even approximating) the chromatic polynomial is known to be #P-hard, but it is unknown whether or not the approximation at the value -1 is. There are two key contributions in this thesis. Firstly, we obtain computational results for all graphs with up to 8 vertices. We use the data to make observations on the structure of minimal and maximal graphs, by which we mean graphs with the fewest and greatest number of acyclic orientations respectively, as well as on the distribution of acyclic orientations. Many conjectures on the structure of extremal graphs arise, of which we prove some in the theoretical part of the thesis. Secondly, we present a compression move which is monotonic with respect to the number of acyclic orientations, and with respect to various other parameters in particular cliques. This move gives us a new approach to classifying all minimal graphs. It also enables us to tackle the harder problem of identifying maximal graphs. We show that certain Turán graphs are uniquely maximal (Turán graphs are complete multipartite graphs with all vertex classes as equal as possible), and conjecture that all Turán graphs are maximal. In addition we derive an explicit formula for the number of acyclic orientations of complete bipartite graphs.","abstract_has_math":false,"creators":["Schumacher, R."],"institution":"City, University of London","degree_name":"phd","degree_level":"doctoral","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2017,"date_issued":"2017","date_published":"2017","updated_at":"2026-07-24T01:39:34Z","subjects":["QA Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Schumacher, R."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2017"]},{"key":"dc:date.issued","label":"Date","values":["2017"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Faculty of Actuarial Science & Insurance","Doctoral Theses","Bayes Business School Doctoral Theses","Faculty of Actuarial Science and Insurance"]},{"key":"dc:publisher.institution","label":"Dc Publisher Institution","values":["City, University of London"]},{"key":"dc:relation.isreferencedby","label":"Dc Relation Isreferencedby","values":["https://openaccess.city.ac.uk/id/eprint/17910/"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.qualificationlevel","label":"Dc Type Qualificationlevel","values":["doctoral"]},{"key":"dc:type.qualificationname","label":"Dc Type Qualificationname","values":["phd"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["QA Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://openaccess.city.ac.uk/id/eprint/17910/1/Schumacher%2C%20Robert_Redacted.pdf"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The efficient use of radio spectrum depends upon frequency assignment within a telecommunications network. The solution space of the frequency assignment problem is best described by the acyclic orientations of the network. An acyclic orientation Ɵ of a graph (network) G is an orientation of the edges of the graph which does not create any directed cycles. We are primarily interested in how many ways this is possible for a given graph, which is the count of the number of acyclic orientations, a(G). This is just the evaluation of the chromatic polynomial of the graph χ(G; λ) at λ = -1. Calculating (and even approximating) the chromatic polynomial is known to be #P-hard, but it is unknown whether or not the approximation at the value -1 is. There are two key contributions in this thesis. Firstly, we obtain computational results for all graphs with up to 8 vertices. We use the data to make observations on the structure of minimal and maximal graphs, by which we mean graphs with the fewest and greatest number of acyclic orientations respectively, as well as on the distribution of acyclic orientations. Many conjectures on the structure of extremal graphs arise, of which we prove some in the theoretical part of the thesis. Secondly, we present a compression move which is monotonic with respect to the number of acyclic orientations, and with respect to various other parameters in particular cliques. This move gives us a new approach to classifying all minimal graphs. It also enables us to tackle the harder problem of identifying maximal graphs. We show that certain Turán graphs are uniquely maximal (Turán graphs are complete multipartite graphs with all vertex classes as equal as possible), and conjecture that all Turán graphs are maximal. In addition we derive an explicit formula for the number of acyclic orientations of complete bipartite graphs."]},{"key":"dc:format","label":"Dc Format","values":["text"]},{"key":"dc:title","label":"Title","values":["Improving the capacity of radio spectrum: exploration of the acyclic orientations of a graph"]}]}],"canonical_facts":{"dc:creator":["Schumacher, R."],"dc:date":["2017"],"dc:date.issued":["2017"],"dc:description.abstract":["The efficient use of radio spectrum depends upon frequency assignment within a telecommunications network. The solution space of the frequency assignment problem is best described by the acyclic orientations of the network. An acyclic orientation Ɵ of a graph (network) G is an orientation of the edges of the graph which does not create any directed cycles. We are primarily interested in how many ways this is possible for a given graph, which is the count of the number of acyclic orientations, a(G). This is just the evaluation of the chromatic polynomial of the graph χ(G; λ) at λ = -1. Calculating (and even approximating) the chromatic polynomial is known to be #P-hard, but it is unknown whether or not the approximation at the value -1 is. There are two key contributions in this thesis. Firstly, we obtain computational results for all graphs with up to 8 vertices. We use the data to make observations on the structure of minimal and maximal graphs, by which we mean graphs with the fewest and greatest number of acyclic orientations respectively, as well as on the distribution of acyclic orientations. Many conjectures on the structure of extremal graphs arise, of which we prove some in the theoretical part of the thesis. Secondly, we present a compression move which is monotonic with respect to the number of acyclic orientations, and with respect to various other parameters in particular cliques. This move gives us a new approach to classifying all minimal graphs. It also enables us to tackle the harder problem of identifying maximal graphs. We show that certain Turán graphs are uniquely maximal (Turán graphs are complete multipartite graphs with all vertex classes as equal as possible), and conjecture that all Turán graphs are maximal. In addition we derive an explicit formula for the number of acyclic orientations of complete bipartite graphs."],"dc:format":["text"],"dc:identifier.uri":["https://openaccess.city.ac.uk/id/eprint/17910/1/Schumacher%2C%20Robert_Redacted.pdf"],"dc:publisher.department":["Faculty of Actuarial Science & Insurance","Doctoral Theses","Bayes Business School Doctoral Theses","Faculty of Actuarial Science and Insurance"],"dc:publisher.institution":["City, University of London"],"dc:relation.isreferencedby":["https://openaccess.city.ac.uk/id/eprint/17910/"],"dc:subject":["QA Mathematics"],"dc:title":["Improving the capacity of radio spectrum: exploration of the acyclic orientations of a graph"],"dc:type":["Thesis"],"dc:type.qualificationlevel":["doctoral"],"dc:type.qualificationname":["phd"]},"updated_at":"2026-07-24T01:39:34Z"}