Sciweavers

232 search results - page 26 / 47
» jct 2006
Sort
View
JCT
2007
142views more  JCT 2007»
14 years 9 months ago
Graphs that triangulate a given surface and quadrangulate another surface
We show that for any closed surface F with χ(F) −4 (or χ(F) −2), there exist graphs that triangulate the torus or the Klein bottle (or the projective plane) and that quadran...
Yusuke Suzuki
JCT
2008
84views more  JCT 2008»
14 years 8 months ago
Wild triangles in 3-connected matroids
Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of M relative to {a, b, c} when, for all t in {a, b, c}, either M\t is not 3-connec...
James G. Oxley, Charles Semple, Geoff Whittle
JCT
2006
109views more  JCT 2006»
14 years 9 months ago
On the combinatorial invariance of Kazhdan-Lusztig polynomials
We prove that the Kazhdan-Lusztig polynomials are combinatorial invariants for intervals up to length 8 in Coxeter groups of type A and up to length 6 in Coxeter groups of type B a...
Federico Incitti
JCT
2006
53views more  JCT 2006»
14 years 9 months ago
On the number of factorizations of a full cycle
We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic me...
John Irving
JCT
2006
70views more  JCT 2006»
14 years 9 months ago
Sparse halves in triangle-free graphs
One of Erdos' favourite conjectures was that any triangle-free graph G on n vertices should contain a set of n/2 vertices that spans at most n2/50 edges. We prove this when t...
Peter Keevash, Benny Sudakov