2 research outputs found
Equicovering matroids by distinct bases
AbstractWe ask, and answer, the following question: when is it possible to cover the elements of a given matroid M by p distinct bases so that each element is covered exactly k times? Our result is weaker than the Cyclic Order Conjecture of Wiedemann [9] (and of Kajitani, Ueno and Miyano [7]), but stronger than similar previous results; it could represent a first step towards resolving the conjecture
Extremal problems involving forbidden subgraphs
In this thesis, we study extremal problems involving forbidden subgraphs. We are interested in extremal problems over a family of graphs or over a family of hypergraphs.
In Chapter 2, we consider improper coloring of graphs without short cycles. We find how sparse an improperly critical graph can be when it has no short cycle. In particular, we find the exact threshold of density of triangle-free -colorable graphs and we find the asymptotic threshold of density of -colorable graphs of large girth when .
In Chapter 3, we consider other variations of graph coloring. We determine harmonious chromatic number of trees with large maximum degree and show upper bounds of -dynamic chromatic number of graphs in terms of other parameters.
In Chapter 4, we consider how dense a hypergraph can be when we forbid some subgraphs.
In particular, we characterize hypergraphs with the maximum number of edges that contain no -regular subgraphs. We also establish upper bounds for the number of edges in graphs and hypergraphs with no edge-disjoint equicovering subgraphs