Search results for "Comb."

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Claude Laflamme, Lionel Nguyen Van Thé, Norbert W. Sauer	Partition properties of the dense local order and a colored version of Milliken's theorem.	Comb.	2010	DBLP DOI BibTeX RDF
1	Venkatesan Guruswami, James R. Lee, Alexander A. Razborov	Almost Euclidean subspaces of l 1N VIA expander codes.	Comb.	2010	DBLP DOI BibTeX RDF
1	E. Rodney Canfield, Brendan D. McKay	Asymptotic enumeration of integer matrices with large equal row and column sums.	Comb.	2010	DBLP DOI BibTeX RDF
1	Ada Chan, Chris D. Godsil	Type-II matrices and combinatorial structures.	Comb.	2010	DBLP DOI BibTeX RDF
1	Martin Marciniszyn, Reto Spöhel	Online vertex-coloring games in random graphs.	Comb.	2010	DBLP DOI BibTeX RDF
1	Ernest E. Shult, Koen Thas	A theorem of Cohen on parapolar spaces.	Comb.	2010	DBLP DOI BibTeX RDF
1	Van H. Vu	Structure of large incomplete sets in abelian groups.	Comb.	2010	DBLP DOI BibTeX RDF
1	Bill Jackson	An inequality for Tutte polynomials.	Comb.	2010	DBLP DOI BibTeX RDF
1	Torsten Korneffel, Eberhard Triesch	An asymptotic bound for the complexity of monotone graph properties.	Comb.	2010	DBLP DOI BibTeX RDF
1	Guo-Niu Han	New hook length formulas for binary trees.	Comb.	2010	DBLP DOI BibTeX RDF
1	Shinya Fujita 0001, Ken-ichi Kawarabayashi	Non-separating even cycles in highly connected graphs.	Comb.	2010	DBLP DOI BibTeX RDF
1	Katalin Gyarmati, Máté Matolcsi, Imre Z. Ruzsa	A superadditivity and submultiplicativity property for cardinalities of sumsets.	Comb.	2010	DBLP DOI BibTeX RDF
1	Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001	Algorithms for finding an induced cycle in planar graphs.	Comb.	2010	DBLP DOI BibTeX RDF
1	Reinhard Diestel, Philipp Sprüssel	The homology of a locally finite graph with ends.	Comb.	2010	DBLP DOI BibTeX RDF
1	Ryan O'Donnell, Rocco A. Servedio	New degree bounds for polynomial threshold functions.	Comb.	2010	DBLP DOI BibTeX RDF
1	Manor Mendel, Assaf Naor	Maximum gradient embeddings and monotone clustering.	Comb.	2010	DBLP DOI BibTeX RDF
1	Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang	Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs.	Comb.	2010	DBLP DOI BibTeX RDF
1	Maria Chudnovsky, Paul D. Seymour	The three-in-a-tree problem.	Comb.	2010	DBLP DOI BibTeX RDF
1	Benny Sudakov, Jan Vondrák	A randomized embedding algorithm for trees.	Comb.	2010	DBLP DOI BibTeX RDF
1	Peter Keevash, Dhruv Mubayi	Set systems without a simplex or a cluster.	Comb.	2010	DBLP DOI BibTeX RDF
1	Satoru Fujishige	A note on disjoint arborescences.	Comb.	2010	DBLP DOI BibTeX RDF
1	Raphael Yuster	Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets.	Comb.	2010	DBLP DOI BibTeX RDF
1	Péter Csikvári	On a poset of trees.	Comb.	2010	DBLP DOI BibTeX RDF
1	Rade T. Zivaljevic	Oriented matroids and Ky Fan's theorem.	Comb.	2010	DBLP DOI BibTeX RDF
1	Gábor Elek	On the limit of large girth graph sequences.	Comb.	2010	DBLP DOI BibTeX RDF
1	Henry A. Kierstead, Alexandr V. Kostochka	Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture.	Comb.	2010	DBLP DOI BibTeX RDF
1	George Androulakis, Stephen J. Dilworth, Nigel J. Kalton	A new approach to the Ramsey-type games and the Gowers dichotomy in F-spaces.	Comb.	2010	DBLP DOI BibTeX RDF
1	Tom Bohman, Alan M. Frieze, Dhruv Mubayi, Oleg Pikhurko	Hypergraphs with independent neighborhoods.	Comb.	2010	DBLP DOI BibTeX RDF
1	Hiroshi Hirai 0001	Metric packing for K3+K3.	Comb.	2010	DBLP DOI BibTeX RDF
1	Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi	A fast algorithm for equitable coloring.	Comb.	2010	DBLP DOI BibTeX RDF
1	Baogang Xu, Xingxing Yu	On a bipartition problem of Bollobás and Scott.	Comb.	2009	DBLP DOI BibTeX RDF
1	Anton Dochtermann	The universality of Hom complexes of graphs.	Comb.	2009	DBLP DOI BibTeX RDF
1	Attila Pór, David R. Wood	Colourings of the cartesian product of graphs and multiplicative Sidon sets.	Comb.	2009	DBLP DOI BibTeX RDF
1	Noga Alon, Eyal Lubetzky	Uniformly cross intersecting families.	Comb.	2009	DBLP DOI BibTeX RDF
1	Beukje Temmermans, Joseph A. Thas, Hendrik Van Maldeghem	On collineations and dualities of finite generalized polygons.	Comb.	2009	DBLP DOI BibTeX RDF
1	Ken-ichi Kawarabayashi, Bruce A. Reed	Highly parity linked graphs.	Comb.	2009	DBLP DOI BibTeX RDF
1	John P. Steinberger	Tilings of the integers can have superpolynomial periods.	Comb.	2009	DBLP DOI BibTeX RDF
1	Werner Schwärzler	On the complexity of the planar edge-disjoint paths problem with terminals on the outer boundary.	Comb.	2009	DBLP DOI BibTeX RDF
1	John Bamberg, Maska Law, Tim Penttila	Tight sets and m-ovoids of generalised quadrangles.	Comb.	2009	DBLP DOI BibTeX RDF
1	Komei Fukuda, Sonoko Moriyama, Hiroki Nakayama, Jürgen Richter-Gebert	Every non-Euclidean oriented matroid admits a biquadratic final polynomial.	Comb.	2009	DBLP DOI BibTeX RDF
1	Tamás Király, Jácint Szabó	A note on parity constrained orientations.	Comb.	2009	DBLP DOI BibTeX RDF
1	Hein van der Holst, Rudi Pendavingh	On a graph property generalizing planarity and flatness.	Comb.	2009	DBLP DOI BibTeX RDF
1	Masao Tsugaki	A note on a spanning 3-tree.	Comb.	2009	DBLP DOI BibTeX RDF
1	Vladimir Nikiforov 0001, Cecil C. Rousseau	Ramsey goodness and beyond.	Comb.	2009	DBLP DOI BibTeX RDF
1	Simeon Ball, Oriol Serra	Punctured combinatorial Nullstellensätze.	Comb.	2009	DBLP DOI BibTeX RDF
1	Béla Bollobás, Boris G. Pittel	The distribution of the root degree of a random permutation.	Comb.	2009	DBLP DOI BibTeX RDF
1	Emanuele Viola, Avi Wigderson	One-way multiparty communication lower bound for pointer jumping with applications.	Comb.	2009	DBLP DOI BibTeX RDF
1	Jacob Fox, Benny Sudakov	Density theorems for bipartite graphs and related Ramsey-type results.	Comb.	2009	DBLP DOI BibTeX RDF
1	Bill Cuckler, Jeff Kahn 0001	Entropy bounds for perfect matchings and Hamiltonian cycles.	Comb.	2009	DBLP DOI BibTeX RDF
1	Dan Hefetz, Michael Krivelevich, Tibor Szabó	Hamilton cycles in highly connected and expanding graphs.	Comb.	2009	DBLP DOI BibTeX RDF
1	Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa	Arc-disjoint in-trees in directed graphs.	Comb.	2009	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	The minimum degree threshold for perfect graph packings.	Comb.	2009	DBLP DOI BibTeX RDF
1	Babak Farzad, Michael Molloy 0001	On the edge-density of 4-critical graphs.	Comb.	2009	DBLP DOI BibTeX RDF
1	Oliver Cooley, Nikolaos Fountoulakis, Daniela Kühn, Deryk Osthus	Embeddings and Ramsey numbers of sparse kappa-uniform hypergraphs.	Comb.	2009	DBLP DOI BibTeX RDF
1	Mei-Chu Chang	Explicit sum-product theorems for large subsets of \mathbbFp.	Comb.	2009	DBLP DOI BibTeX RDF
1	Marek Janata, Jácint Szabó	The superstar packing problem.	Comb.	2009	DBLP DOI BibTeX RDF
1	Bill Cuckler, Jeff Kahn 0001	Hamiltonian cycles in Dirac graphs.	Comb.	2009	DBLP DOI BibTeX RDF
1	Hal A. Kierstead, Goran Konjevod	Coloring number and on-line Ramsey theory for graphs and hypergraphs.	Comb.	2009	DBLP DOI BibTeX RDF
1	Vojtech Rödl, Mathias Schacht	Generalizations of the removal lemma.	Comb.	2009	DBLP DOI BibTeX RDF
1	Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi	On the Fourier spectrum of symmetric Boolean functions.	Comb.	2009	DBLP DOI BibTeX RDF
1	Serguei Norine	Drawing 4-Pfaffian graphs on the torus.	Comb.	2009	DBLP DOI BibTeX RDF
1	Vít Jelínek, Jan Kyncl, Rudolf Stolar, Tomás Valla	Monochromatic triangles in two-colored plane.	Comb.	2009	DBLP DOI BibTeX RDF
1	Massimo Giulietti	Line partitions of internal points to a conic in PG(2, q).	Comb.	2009	DBLP DOI BibTeX RDF
1	Saugata Basu, Richard Pollack, Marie-Françoise Roy	An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions.	Comb.	2009	DBLP DOI BibTeX RDF
1	Gary L. Ebert, Giuseppe Marino 0002, Olga Polverino, Rocco Trombetti	Infinite families of new semifields.	Comb.	2009	DBLP DOI BibTeX RDF
1	Tobias Müller 0001	Two-point concentration in random geometric graphs.	Comb.	2008	DBLP DOI BibTeX RDF
1	Pierre Charbit, András Sebö	Cyclic orders: Equivalence and duality.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C38, 90C27, 90C10, 05C70, 05C20
1	Ori Einstein	Properties of intersecting families of ordered sets.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C35, 05E35, 06A07
1	Jürgen Herzog, Satoshi Murai, Xinxian Zheng, Takayuki Hibi, Ngô Viêt Trung	Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05D05, 05C69
1	Michael I. Hartley	An exploration of locally projective polytopes.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 51M20, 52B15
1	Erik D. Demaine, MohammadTaghi Hajiaghayi	Linearity of grid minors in treewidth with applications through bidimensionality.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C83, 68R10, 05C85
1	Dragomir Z. Dokovic	Hadamard matrices of order 764 exist.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05B20, 05B30
1	Michael Molloy 0001	When does the giant component bring unsatisfiability?	Comb.	2008	DBLP DOI BibTeX RDF
1	Asaf Shapira	Quasi-randomness and the distribution of copies of a fixed graph.	Comb.	2008	DBLP DOI BibTeX RDF
1	Javier Cilleruelo, Melvyn B. Nathanson	Perfect difference sets constructed from Sidon sets.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 11B13, 11B34
1	Daniel Král, Robin Thomas 0001	Coloring even-faced graphs in the torus and the Klein bottle.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C15, 05C10
1	David P. Bunde, Kevin G. Milans, Douglas B. West, Hehui Wu	Optimal strong parity edge-coloring of complete graphs.	Comb.	2008	DBLP DOI BibTeX RDF
1	Jacob E. Goodman, Richard Pollack	The combinatorial encoding of disjoint convex sets in the plane.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52A35, 52C30
1	Hemanshu Kaul, Alexandr V. Kostochka, Gexin Yu	On a graph packing conjecture by Bollobás, Eldridge and Catlin.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C35, 05C70
1	Vojtech Rödl, Endre Szemerédi, Andrzej Rucinski 0001	An approximate Dirac-type theorem for k -uniform hypergraphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C65, 05C45, 05D05
1	Márton Makai, Jácint Szabó	The parity problem of polymatroids without double circuits.	Comb.	2008	DBLP DOI BibTeX RDF
1	Oleg Pikhurko	An exact Turán result for the generalized triangle.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05D05, 05C35
1	József Solymosi, Van H. Vu	Near optimal bounds for the Erdös distinct distances problem in high dimensions.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 52C10
1	Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura	The stable set polytope of quasi-line graphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C57, 90C10
1	Siddhartha Sahi	Higher correlation inequalities.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05A20, 26D07, 82B20, 60E15
1	Satoru Iwata 0001, Takuro Matsuda	Finding coherent cyclic orders in strong digraphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C20, 90C27
1	Rom Pinchasi	Geometric graphs with no two parallel edges.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C10
1	Assaf Naor, Jacques Verstraëte	Parity check matrices and product representations of squares.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05Cxx, 05Dxx, 94B65
1	Vsevolod F. Lev	The rectifiability threshold in abelian groups.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 11P70, 11B75
1	Ehud Friedgut	On the measure of intersecting families, uniqueness and stability.	Comb.	2008	DBLP DOI BibTeX RDF
1	Andreas F. Holmsen, János Pach, Helge Tverberg	Points surrounding the origin.	Comb.	2008	DBLP DOI BibTeX RDF
1	Jonah Blasiak	The toric ideal of a graphic matroid is generated by quadrics.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05B35, 05C05
1	Terence Tao	Product set estimates for non-commutative groups.	Comb.	2008	DBLP DOI BibTeX RDF
1	Benny Sudakov, Jacques Verstraëte	Cycle lengths in sparse graphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C35, 05C38
1	Maria Chudnovsky, William H. Cunningham, Jim Geelen	An algorithm for packing non-zero A -paths in group-labelled graphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C22
1	Serguei Norine, Robin Thomas 0001	Pfaffian labelings and signs of edge colorings.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C70, 05C15, 05C75, 05C10
1	Yahya Ould Hamidoune, Oriol Serra, Gilles Zémor	On the critical pair theory in abelian groups: Beyond Chowla's Theorem.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 11P70
1	Ariel Gabizon, Ran Raz	Deterministic extractors for affine sources over large fields.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 11T24, 68Q99, 68R05, 05D10
1	Peter Dukes, Alan C. H. Ling	Note edge-colourings of K n, n with no long two-coloured cycles.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C15, 05B25
1	Carsten Thomassen, Antoine Vella	Graph-like continua, augmenting arcs, and Menger's theorem.	Comb.	2008	DBLP DOI BibTeX RDF

Publications at "Comb."( http://dblp.L3S.de/Venues/Comb. )