Search
Search Results
-
Turán Problems for Oriented Graphs
A classical Turán problem asks for the maximum possible number of edges in a graph of a given order that does not contain a particular graph H as a...
-
A tournament approach to pattern avoiding matrices
We consider the following Turán-type problem: given a fixed tournament H , what is the least integer t = t ( n , H ) so that adding t edges to any n -vertex...
-
Henson graphs and Urysohn—Henson graphs as Cayley graphs
We discuss groups acting regularly on the Henson graphs Γ n , answering a question posed by Peter Cameron, and we explore a number of related...
-
Dual Integrality in Combinatorial Optimization
The notion of total dual integrality and its variants are powerful tools to derive combinatorial min-max relation efficiently, yielding many...
-
Prime Orders All of Whose Prime Suborders Are Selfdual
Let P be an order on a set V . A subset A of V is autonomous in P if every element of V not in A is either less than or greater than or incomparable...
-
Orientations of Graphs and Digraphs
The purpose of this chapter is to discuss various aspects of orientations of (multi)graphs. There are many ways of looking at such questions. We can...
-
Antichains of Bounded Size in the Class of Tournaments
Tournament embedding is an order relation on the class of finite tournaments. An antichain is a set of finite tournaments that are pairwise...
-
Hamiltonian Refinements
In this chapter we discuss results which in one way or another generalize the notion of hamiltonicity. As can be seen from the content of the...
-
Introduction
This is an edited list of articles concerned with the role of graphs in the theory of ordered sets and its applications. The list is not a cumulative...