Sciweavers

COMBINATORICA
2008
93views more  COMBINATORICA 2008»
13 years 11 months ago
Cycle lengths in sparse graphs
Benny Sudakov, Jacques Verstraëte
COMBINATORICA
2008
92views more  COMBINATORICA 2008»
13 years 11 months ago
A separation theorem in property testing
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...
Noga Alon, Asaf Shapira
COMBINATORICA
2008
104views more  COMBINATORICA 2008»
13 years 11 months ago
Linearity of grid minors in treewidth with applications through bidimensionality
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an (w)
Erik D. Demaine, MohammadTaghi Hajiaghayi
COMBINATORICA
2008
97views more  COMBINATORICA 2008»
13 years 11 months ago
Cyclic orders: Equivalence and duality
Cyclic orders of graphs and their equivalence have been promoted by Bessy and Thomass
Pierre Charbit, András Sebö
COMBINATORICA
2008
95views more  COMBINATORICA 2008»
13 years 11 months ago
Cycles in dense digraphs
Maria Chudnovsky, Paul D. Seymour, Blair Sullivan
COMBINATORICA
2008
62views more  COMBINATORICA 2008»
13 years 11 months ago
The toric ideal of a graphic matroid is generated by quadrics
Describing minimal generating sets of toric ideals is a well-studied and difficult problem. Neil White conjectured in 1980 that the toric ideal associated to a matroid is generated...
Jonah Blasiak
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 11 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
COMBINATORICA
2008
88views more  COMBINATORICA 2008»
13 years 11 months ago
Geometric graphs with no two parallel edges
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges...
Rom Pinchasi
COMBINATORICA
2008
129views more  COMBINATORICA 2008»
13 years 11 months ago
The combinatorial encoding of disjoint convex sets in the plane
We introduce a new combinatorial object, the double-permutation sequence, and use it to encode a family of mutually disjoint compact convex sets in the plane in a way that capture...
Jacob E. Goodman, Richard Pollack
COMBINATORICA
2008
97views more  COMBINATORICA 2008»
13 years 11 months ago
Pfaffian labelings and signs of edge colorings
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
Serguei Norine, Robin Thomas