Thesis icon

Thesis

Homogeneous sets in graphs and hypergraphs

Abstract:

A set of vertices in a graph or a hypergraph is called homogeneous if it is independent, that is it does not contain any edge, or if it is complete, that is it contains all possible pairs or subsets of it as edges. We investigate the properties of graphs and hypergraphs in two cases of imposed restrictions on the structure of their homogeneous sets.

First we study the asymptotic structure of random perfect graphs. We give a generation model which yields such graphs almost uniformly...

Expand abstract

Actions


Access Document


Files:

Authors


More by this author
Division:
MPLS
Department:
Computer Science
Department:
University of Oxford
Role:
Author

Contributors

Department:
University of Oxford
Role:
Supervisor
Role:
Supervisor
More from this funder
Funding agency for:
Yolov, N
Grant:
OUCL/2013/NY
Type of award:
DPhil
Level of award:
Doctoral
Awarding institution:
University of Oxford
UUID:
uuid:23a05b21-773b-4bf9-8776-1bd4b10c3c34
Deposit date:
2018-07-06

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP