## Browse

S-Space
College of Education (사범대학)
Dept. of Mathematics Education (수학교육과)
Theses (Ph.D. / Sc.D._수학교육과)

A study on the competition graphs of d-partial orders*d-반순서의 경쟁그래프의 연구*

DC Field | Value | Language |
---|---|---|

dc.contributor.advisor | 김서령 | - |

dc.contributor.author | 최지훈 | - |

dc.date.accessioned | 2018-05-28T16:42:47Z | - |

dc.date.available | 2018-05-28T16:42:47Z | - |

dc.date.issued | 2018-02 | - |

dc.identifier.other | 000000151194 | - |

dc.identifier.uri | http://hdl.handle.net/10371/140870 | - |

dc.description | 학위논문 (박사)-- 서울대학교 대학원 : 사범대학 수학교육과, 2018. 2. 김서령. | - |

dc.description.abstract | The \emph{competition graph} $C(D)$ of a digraph $D$ is defined to be a graph whose vertex set is the same as $D$ and which has an edge joining two distinct vertices $x$ and $y$ if and only if there are arcs $(x,z)$ and $(y,z)$ for some vertex $z$ in $D$. Competition graphs have been extensively studied for more than four decades.
Cohen~\cite{cohen1968interval, cohen1977food, cohen1978food} empirically observed that most competition graphs of acyclic digraphs representing food webs are interval graphs. Roberts~\cite{roberts1978food} asked whether or not Cohen's observation was just an artifact of the construction, and then concluded that it was not by showing that if $G$ is an arbitrary graph, then $G$ together with additional isolated vertices as many as the number of edges of $G$ is the competition graph of some acyclic digraph. Then he asked for a characterization of acyclic digraphs whose competition graphs are interval graphs. Since then, the problem has remained elusive and it has been one of the basic open problems in the study of competition graphs. There have been a lot of efforts to settle the problem and some progress has been made. While Cho and Kim~\cite{cho2005class} tried to answer his question, they could show that the competition graphs of doubly partial orders are interval graphs. They also showed that an interval graph together with sufficiently many isolated vertices is the competition graph of a doubly partial order. In this thesis, we study the competition graphs of $d$-partial orders some of which generalize the results on the competition graphs of doubly partial orders. For a positive integer $d$, a digraph $D$ is called a \emph{$d$-partial order} if $V(D) \subset \RR^d$ and there is an arc from a vertex $\mathbf{x}$ to a vertex $\mathbf{y}$ if and only if $\mathbf{x}$ is componentwise greater than $\mathbf{y}$. A doubly partial order is a $2$-partial order. We show that every graph $G$ is the competition graph of a $d$-partial order for some nonnegative integer $d$, call the smallest such $d$ the \emph{partial order competition dimension} of $G$, and denote it by $\dim_\text{poc}(G)$. This notion extends the statement that the competition graph of a doubly partial order is interval and the statement that any interval graph can be the competition graph of a doubly partial order as long as sufficiently many isolated vertices are added, which were proven by Cho and Kim~\cite{cho2005class}. Then we study the partial order competition dimensions of some interesting families of graphs. We also study the $m$-step competition graphs and the competition hypergraph of $d$-partial orders. | - |

dc.description.tableofcontents | 1 Introduction 1
1.1 Basic notions in graph theory 1 1.2 Competition graphs 6 1.2.1 A brief history of competition graphs 6 1.2.2 Competition numbers 7 1.2.3 Interval competition graphs 10 1.3 Variants of competition graphs 14 1.3.1 m-step competition graphs 15 1.3.2 Competition hypergraphs 16 1.4 A preview of the thesis 18 2 On the competition graphs of d-partial orders 1 20 2.1 The notion of d-partial order 20 2.2 The competition graphs of d-partial orders 21 2.2.1 The regular (d − 1)-dimensional simplex △ d−1 (p) 22 2.2.2 A bijection from H d + to a set of regular (d − 1)-simplices 23 2.2.3 A characterization of the competition graphs of d-partial orders 25 2.2.4 Intersection graphs and competition graphs of d-partial orders 27 2.3 The partial order competition dimension of a graph 29 3 On the partial order competition dimensions of chordal graphs 2 38 3.1 Basic properties on the competition graphs of 3-partial orders 39 3.2 The partial order competition dimensions of diamond-free chordal graphs 42 3.3 Chordal graphs having partial order competition dimension greater than three 46 4 The partial order competition dimensions of bipartite graphs 3 53 4.1 Order types of two points in R 3 53 4.2 An upper bound for the the partial order competition dimension of a graph 57 4.3 Partial order competition dimensions of bipartite graphs 64 5 On the m-step competition graphs of d-partial orders 4 69 5.1 A characterization of the m-step competition graphs of dpartial orders 69 5.2 Partial order m-step competition dimensions of graphs 71 5.3 dim poc (G | - |

dc.description.tableofcontents | m) in the aspect of dim poc (G) 76
5.4 Partial order competition exponents of graphs 79 6 On the competition hypergraphs of d-partial orders 5 81 6.1 A characterization of the competition hypergraphs of d-partial orders 81 6.2 The partial order competition hyper-dimension of a hypergraph 82 6.3 Interval competition hypergraphs 88 Abstract (in Korean) 99 | - |

dc.format | application/pdf | - |

dc.format.extent | 942195 bytes | - |

dc.format.medium | application/pdf | - |

dc.language.iso | en | - |

dc.publisher | 서울대학교 대학원 | - |

dc.subject | competition graphs | - |

dc.subject | d-partial orders | - |

dc.subject | partial order competition dimension | - |

dc.subject | homothetic regular simplices | - |

dc.subject | order types | - |

dc.subject.ddc | 510.7 | - |

dc.title | A study on the competition graphs of d-partial orders | - |

dc.title.alternative | d-반순서의 경쟁그래프의 연구 | - |

dc.type | Thesis | - |

dc.description.degree | Doctor | - |

dc.contributor.affiliation | 사범대학 수학교육과 | - |

dc.date.awarded | 2018-02 | - |

- Appears in Collections:
- College of Education (사범대학)Dept. of Mathematics Education (수학교육과)Theses (Ph.D. / Sc.D._수학교육과)

- Files in This Item:

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.