• 2009
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a size bounded by a polynomial in a specified parameter (or, in short: do not have a polynomial kernel); these results are assuming the validity of certain complexity theoretic(More)
We prove that given an undirected graph <i>G</i> on <i>n</i> vertices and an integer <i>k</i>, one can compute, in polynomial time in <i>n</i>, a graph <i>G&#8242;</i> with at most 4<i>k</i><sup>2</sup> vertices and an integer <i>k&#8242;</i> such that <i>G</i> has a feedback vertex set of size at most <i>k</i> iff <i>G&#8242;</i> has a feedback vertex set(More)
We prove that given an undirected graph G on n vertices and an integer k, one can compute in polynomial time in n a graph G with at most 5k 2 +k vertices and an integer k such that G has a feedback vertex set of size at most k iff G has a feedback vertex set of size at most k. This result improves a previous O(k 11) kernel of Burrage et al. [6], and a more(More)
• 2010
We prove that every graph G has a vertex partition into a cycle and an anticycle (a cycle in the complement of G). Emptyset, singletons and edges are considered as cycles. This problem was posed by Lehel and shown to be true for very large graphs by Luczak, Rödl and Szemerédi [7], and more recently for large graphs by Allen [1]. Many questions deal with the(More)
• 2006
We consider the problem of finding a large or dense triangle-free subgraph in a given graph G. In response to a question of P. Erd˝ os, we prove that, if the minimum degree of G is at least 17|V (G)|/20, the largest triangle-free subgraphs are precisely the largest bipartite subgraphs in G. We investigate in particular the case where G is a complete(More)
• 2000
We give a short constructive proof of a theorem of Fisher: every tournament contains a vertex whose second outneighborhood is as large as its ®rst outneighborhood. Moreover, we exhibit two such vertices provided that the tournament has no dominated vertex. The proof makes use of median orders. A second application of median orders is that every tournament(More)
The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Abstract A tournament is a complete graph with its edges directed, and colouring a tournament means partitioning its vertex set into transitive subtournaments. For some tournaments H there exists c such that every tournament not containing(More)
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, the Feedback Arc Set problem asks whether the given digraph has a set of k arcs whose removal results in an acyclic digraph. The Feedback Arc Set problem restricted to tournaments is(More)
• 2
• 2014
Answering a question of Kalai and Meshulam, we prove that graphs without induced cycles of length 3k have bounded chromatic number. This implies the very first case of a much broader question asserting that every graph with large chromatic number induces a graph H such that the sum of the Betti numbers of the independence complex of H is also large.
• 2