1,275 research outputs found
Recommended from our members
Combinatorics
Combinatorics is a fundamental mathematical discipline which focuses on the study of discrete objects and their properties. The current workshop brought together researchers from diverse fields such as Extremal and Probabilistic Combinatorics, Discrete Geometry, Graph theory, Combiantorial Optimization and Algebraic Combinatorics for a fruitful interaction. New results, methods and developments and future challenges were discussed. This is a report on the meeting containing abstracts of the presentations and a summary of the problem session
Limits on Relief through Constrained Exchange on Random Graphs
Agents are represented by nodes on a random graph (e.g., small world or
truncated power law). Each agent is endowed with a zero-mean random value that
may be either positive or negative. All agents attempt to find relief, i.e., to
reduce the magnitude of that initial value, to zero if possible, through
exchanges. The exchange occurs only between agents that are linked, a
constraint that turns out to dominate the results. The exchange process
continues until a Pareto equilibrium is achieved. Only 40%-90% of the agents
achieved relief on small world graphs with mean degree between 2 and 40. Even
fewer agents achieved relief on scale-free like graphs with a truncated power
law degree distribution. The rate at which relief grew with increasing degree
was slow, only at most logarithmic for all of the graphs considered; viewed in
reverse, relief is resilient to the removal of links.Comment: 8 pages, 2 figures, 22 references Changes include name change for
Lory A. Ellebracht (formerly Cooperstock, e-mail address stays the same),
elimination of contractions and additional references. We also note that our
results are less surprising in view of other work now cite
Vertex Sequences in Graphs
We consider a variety of types of vertex sequences, which are defined in terms of a requirement that the next vertex in the sequence must meet. For example, let S = (v1, v2, …, vk ) be a sequence of distinct vertices in a graph G such that every vertex vi in S dominates at least one vertex in V that is not dominated by any of the vertices preceding it in the sequence S. Such a sequence of maximal length is called a dominating sequence since the set {v1, v2, …, vk } must be a dominating set of G. In this paper we survey the literature on dominating and other related sequences, and propose for future study several new types of vertex sequences, which suggest the beginning of a theory of vertex sequences in graphs
Maximum Oriented Forcing Number for Complete Graphs
The \emph{maximum oriented -forcing number} of a simple graph , written \MOF_k(G), is the maximum \emph{directed -forcing number} among all orientations of . This invariant was recently introduced by Caro, Davila and Pepper in~\cite{CaroDavilaPepper}, and in the current paper we study the special case where is the complete graph with order , denoted . While \MOF_k(G) is an invariant for the underlying simple graph , \MOF_k(K_n) can also be interpreted as an interesting property for tournaments. Our main results further focus on the case when . These include a lower bound on \MOF(K_n) of roughly , and for , a lower bound of . We also consider various lower bounds on the maximum oriented -forcing number for the closely related complete -partite graphs
On the structure of graphs with forbidden induced substructures
One of the central goals in extremal combinatorics is to understand how the global structure of a combinatorial object, e.g. a graph, hypergraph or set system, is affected by local constraints.
In this thesis we are concerned with structural properties of graphs and hypergraphs which locally do not look like some type of forbidden induced pattern. Patterns can be single subgraphs, families of subgraphs, or in the multicolour version colourings or families of colourings of subgraphs.
Erdős and Szekeres\u27s quantitative version of Ramsey\u27s theorem asserts that in every -edge-colouring of the complete graph on vertices there is a monochromatic clique on at least vertices. The famous Erdős-Hajnal conjecture asserts that forbidding fixed colourings on subgraphs ensures much larger monochromatic cliques. The conjecture is open in general, though a few partial results are known. The first part of this thesis will be concerned with different variants of this conjecture: A bipartite variant, a multicolour variant, and an order-size variant for hypergraphs.
In the second part of this thesis we focus more on order-size pairs; an order-size pair is the family consisting of all graphs of order and size , i.e. on vertices with edges. We consider order-size pairs in different settings: The graph setting, the bipartite setting and the hypergraph setting. In all these settings we investigate the existence of absolutely avoidable pairs, i.e. fixed pairs that are avoided by all order-size pairs with sufficiently large order, and also forcing densities of order-size pairs , i.e. for approaching infinity, the limit superior of the fraction of all possible sizes , such that the order-size pair does not avoid the pair
On-line partitioning of width w posets into w^O(log log w) chains
An on-line chain partitioning algorithm receives the elements of a poset one
at a time, and when an element is received, irrevocably assigns it to one of
the chains. In this paper, we present an on-line algorithm that partitions
posets of width into chains. This improves over
previously best known algorithms using chains by Bosek and
Krawczyk and by Bosek, Kierstead, Krawczyk, Matecki, and Smith. Our algorithm
runs in time, where is the width and is the size of
a presented poset.Comment: 16 pages, 10 figure
Enumeration of Matchings: Problems and Progress
This document is built around a list of thirty-two problems in enumeration of
matchings, the first twenty of which were presented in a lecture at MSRI in the
fall of 1996. I begin with a capsule history of the topic of enumeration of
matchings. The twenty original problems, with commentary, comprise the bulk of
the article. I give an account of the progress that has been made on these
problems as of this writing, and include pointers to both the printed and
on-line literature; roughly half of the original twenty problems were solved by
participants in the MSRI Workshop on Combinatorics, their students, and others,
between 1996 and 1999. The article concludes with a dozen new open problems.
(Note: This article supersedes math.CO/9801060 and math.CO/9801061.)Comment: 1+37 pages; to appear in "New Perspectives in Geometric
Combinatorics" (ed. by Billera, Bjorner, Green, Simeon, and Stanley),
Mathematical Science Research Institute publication #37, Cambridge University
Press, 199
- …