Search results for "Comb."

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Louis Kauffman, Robin Thomas 0001	Temperely-Lieb Algebras and the Four-Color Theorem.	Comb.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C15, 82B20
1	Guantao Chen, Ronald J. Gould, Xingxing Yu	Graph Connectivity After Path Removal.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C40, 05C38
1	Etsuko Bannai, Kazuki Kawasaki, Yusuke Nitamizu, Teppei Sato	An Upper Bound for the Cardinality of an s-Distance Set in Euclidean Space.	Comb.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05E99, 05B99, 51M99, 62K99
1	Stephan Brandt	Note.	Comb.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05C15, 05C75
1	Anders Björner, Mark de Longueville	Neighborhood Complexes of Stable Kneser Graphs.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05E99, 05C69, 55P15, 05C15
1	Friedrich Eisenbrand, Andreas S. Schulz	Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 52B05, 90C27, 68Q17, 90C57, 90C10, 90C60
1	András Hajnal, Péter Komjáth	Some Remarks on the Simultaneous Chromatic Number.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 03E35, 05C15
1	Béla Csaba, Ali Shokoufandeh, Endre Szemerédi	Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C35, 05C70
1	Jeong Han Kim, Van H. Vu	Small Complete Arcs in Projective Planes.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05B25
1	András Gács	On a Generalization of Rédei's Theorem.	Comb.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 51E15
1	James D. Currie, Cameron W. Pierce	The Fixing Block Method in Combinatorics on Words.	Comb.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05-XX, 68Q45
1	Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz	For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C80, 05A16, 05C35
1	Zoltán Szigeti	Perfect Matchings Versus Odd Cuts.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C70
1	Alexandr V. Kostochka	Transversals in Uniform Hypergraphs with Property (p, 2).	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C65
1	András Gyárfás, Alice Hubenko, József Solymosi	Large Cliques in C4-Free Graphs.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C35
1	J. H. Boutet de Monvel, O. C. Martin	Almost Sure Convergence of the Minimum Bipartite Matching Functional in Euclidean Space.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 60D05
1	Michele Conforti, Gérard Cornuéjols, Grigor Gasparyan, Kristina Vuskovic	Perfect Graphs, Partitionable Graphs and Cutsets.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C17
1	Chi-Jen Lu	Improved Pseudorandom Generators for Combinatorial Rectangles.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05B40, 68Q25, 68R05
1	Carsten Thomassen	On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C15, 05C35
1	András Gyárfás	Transitive Edge Coloring of Graphs and Dimension of Lattices.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) 05C15
1	Martin Henk, Robert Weismantel	Diophantine Approximations and Integer Points of Cones.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 52C07, 90C27
1	Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao	Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 03F20, 68Q17
1	Fan R. K. Chung, Ronald L. Graham	Sparse Quasi-Random Graphs.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C80
1	Anna Galluccio, Luis A. Goddyn	The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C70, 90C35, 90B10
1	Aleksander Malnic, Dragan Marusic, Norbert Seifter, Boris Zgrablic	Highly Arc-Transitive Digraphs With No Homomorphism Onto Z.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C25, 05C20
1	Uriel Feige, Christian Scheideler	Improved Bounds for Acyclic Job Shop Scheduling.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68M20, 90B35, 68W25
1	Erez Petrank, Gábor Tardos	On the Knowledge Complexity of NP.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68Q15, 68Q17
1	Jean François Maurras	From Membership to Separation, a Simple Construction.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05Cxx, 11H06, 11J13
1	Peter J. Grabner, Peter Kirschenhofer, Robert F. Tichy	Combinatorial and Arithmetical Properties of Linear Numeration Systems.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 11K55, 05A17, 11A63, 28D20
1	András Frank, Zoltán Király	Graph Orientations with Edge-connection and Parity Constraints.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C75, 05C40
1	Ya-Chen Chen, Zoltán Füredi	Hamiltonian Kneser Graphs.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C45, 05C38
1	József Beck	Positional Games and the Second Moment Method.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 91A24
1	Amnon Ta-Shma	Almost Optimal Dispersers.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68Q01, 68R10
1	Andreas Huck, Eberhard Triesch	Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C65, 05C70
1	Juan José Montellano-Ballesteros, Victor Neumann-Lara	An Anti-Ramsey Theorem.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C35, 05C99
1	Pavel Pudlák	Cycles of Nonzero Elements in Low Rank Matrices.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C99, 15A99, 68R10
1	Penny E. Haxell, Tomasz Luczak 0001, P. W. Tingley	Ramsey Numbers for Trees of Small Maximum Degree.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C05, 05C55
1	Michael R. Capalbo	Small Universal Graphs for Bounded-Degree Planar Graphs.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C35
1	Frantisek Franek	On Erdös's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C04
1	Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki	Convex Embeddings and Bisections of 3-Connected Graphs 1.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C40, 05C35
1	Ron Aharoni, Eli Berger, Ran Ziv	A Tree Version of Konig's Theorem.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C70
1	Nathan Linial, Alex Samorodnitsky	Linear Codes and Character Sums.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 94B65, 05D05
1	Krishnaswami Alladi, Alexander Berkovich	A Double Bounded Version of Schur's Partition Theorem.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05A15, 05A17, 11P81, 11P83
1	Uriel Feige, Oleg Verbitsky 0001	Error Reduction by Parallel Repetition - A Negative Result.	Comb.	2002	DBLP DOI BibTeX RDF
1	Alon Amit, Nathan Linial	Random Graph Coverings I: General Theory and Graph Connectivity.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C80, 05C40, 05C10
1	Mekkia Kouider, Maryvonne Mahéo	Connected [a, b]-factors in Graphs.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C70
1	Christian Delhommé, Norbert Sauer	Homomorphisms of Products of Graphs into Graphs Without Four Cycles.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C15
1	Penny E. Haxell, Vojtech Rödl	Integer and Fractional Packings in Dense Graphs.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C70, 05C85
1	Guglielmo Lunardon	Linear k-blocking Sets.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 51E20, 51E22, 51E21
1	Kamal Jain	A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68W25, 90C57
1	Odile Marcotte	Optimal Edge-Colourings for a Class of Planar Multigraphs.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C15, 90C10, 05C70
1	Jacob Korevaar	Tauberian Theorem of Erdos Revisited.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 40E05, 11A41
1	Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski 0001	On Bipartite Graphs with Linear Ramsey Numbers.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C55, 05C80, 05D40
1	Noga Alon, János Pach, József Solymosi	Ramsey-type Theorems with Forbidden Subgraphs.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05D10, 05D40, 05C20
1	Roman Nedela, Martin Skoviera	Cayley Snarks and Almost Simple Groups.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C25, 05C15, 05C10
1	László Babai, Thomas P. Hayes, Peter G. Kimmel	The Cost of the Missing Bit: Communication Complexity with Help.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 68Q05, 11K38, 94A99, 68R05, 03D15
1	Dieter Rautenbach, Bruce A. Reed	The Erdos-Pósa Property for Odd Cycles in Highly Connected Graphs.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C40, 05C70, 05C99
1	Alexandr V. Kostochka, Douglas R. Woodall	Density Conditions for Panchromatic Colourings of Hypergraphs.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C65, 05C35, 05C15
1	Y. Katznelson	Chromatic Numbers of Cayley Graphs on Z and Recurrence.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C15, 37B20
1	Richard Cole 0001, Kirstin Ost, Stefan Schirra	Edge-Coloring Bipartite Multigraphs in O(E log D) Time.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68W05, 68W40
1	Norbert Sauer	Another Look at the Erdos-Hajnal-Pósa Results on Partitioning Edges of the Rado Graph.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 03E02, 03C10, 05C55
1	László Lipták, László Lovász 0001	Critical Facets of the Stable Set Polytope.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C69, 90C57
1	Péter Komjáth	Some Remarks on Obligatory Subsytems of Uncountably Chromatic Triple Systems.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C15, 03E05
1	Bojan Mohar	Existence of Polyhedral Embeddings of Graphs.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C10, 68Q17
1	Oleg Pikhurko	Size Ramsey Numbers of Stars Versus 3-chromatic Graphs.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C35
1	Balázs Szegedy	Tilings of the Square With Similar Right Triangles.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 52C20
1	Saharon Shelah	Consistently There Is No Non Trivial CCC Forcing Notion with the Sacks or Laver Property.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 03E05, 03E35
1	Carsten Thomassen	The Erdos-Pósa Property for Odd Cycles in Graphs of Large Connectivity.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C38, 05C40
1	Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma	Vertex Covers by Edge Disjoint Cliques.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C80, 05C35
1	Yonutz Stanchescu	An Upper Bound for d-dimensional Difference Sets.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 52C10, 11P70, 05D05, 11B75
1	Tamás Fleiner	The Size of 3-Cross-Free Families.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05D05, 06A07
1	Roy Meshulam	The Clique Complex and Hypergraph Matching.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05D05, 05D15, 05E25
1	Tamás Fleiner	Note - Uncrossing a Family of Set-Pairs.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C85, 05A05
1	Friedhelm Meyer auf der Heide, Christian Scheideler	Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68W10, 68W20, 68W15
1	Wolfgang Mader 0001	Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C83, 05C35
1	Imre Z. Ruzsa	Additive Completion of Lacunary Sequences.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 11B13, 11B34, 11B83
1	Monique Laurent	On the Sparsity Order of a Graph and Its Deficiency in Chordality.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C50, 15A48, 15A57, 05C75
1	Christian Houdré	Mixed and Isoperimetric Estimates on the Log-Sobolev Constants of Graphs and Markov Chains.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C99, 60J10, 68R10
1	Maria Axenovich, André Kündgen	On a Generalized Anti-Ramsey Problem.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C55, 05C35, 05D40
1	Carsten Thomassen	Totally Odd K4-subdivisions in 4-chromatic Graphs.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C15
1	Daniel J. Kleitman, András Gyárfás, Géza Tóth 0001	Convex Sets in the Plane with Three of Every Four Meeting.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 52A35
1	Károly Podoski	Groups Covered by an Infinite Number of Abelian Subgroups.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 20E34, 20F24
1	Stanislav Jendrol', Ingo Schiermeyer	On a Max-min Problem Concerning Weights of Edges.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C35
1	Gohar M. Kyureghyan	note: On a Degree Property of Cross-Intersecting Families.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05D05, 68R05
1	Ron Aharoni	Ryser's Conjecture for Tripartite 3-Graphs.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05D15
1	Alexandr V. Kostochka, Michael Stiebitz	On the Number of Edges in Colour-Critical Graphs and Hypergraphs.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C15
1	Vojtech Rödl, Endre Szemerédi	On Size Ramsey Numbers of Graphs with Bounded Degree.	Comb.	2000	DBLP DOI BibTeX RDF
1	Malgorzata Bednarska, Tomasz Luczak 0001	Biased Positional Games for Which Random Strategies are Nearly Optimal.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 91A43, 91A24, 05C80
1	Ran Raz	VC-Dimension of Sets of Permutations.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05A05, 05A16, 05A20
1	Ilijas Farah	Approximate Homomorphisms II: Group Homomorphisms.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05D99, 20D99, 28A35, 28A60
1	Michele Conforti, Bert Gerards, Ajai Kapoor	A Theorem of Truemper.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C50, 05B35
1	Joel Friedman	On Cayley Graphs on the Symmetric Group Generated by Tranpositions.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C25, 05C50
1	Andrew Dabrowski, Lawrence S. Moss	The Johnson Graphs Satisfy a Distance Extension Property.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C12, 05C80
1	Sergey G. Bobkov, Christian Houdré, Prasad Tetali	lambdainfty Vertex Isoperimetry and Concentration.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 60C05, 68Q01, 05C50, 60E15
1	Jeong Han Kim, Van H. Vu	Concentration of Multivariate Polynomials and Its Applications.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05, 60
1	Sanjeev Khanna, Nathan Linial, Shmuel Safra	On the Hardness of Approximating the Chromatic Number.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q17, 68Q25, 68R10
1	Raphael Yuster	Decomposing Hypergraphs into Simple Hypertrees.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C65, 05C70
1	Dennis Eichhorn, Dhruv Mubayi	Edge-Coloring Cliques with Many Colors on Subcliques.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C35, 05D10, 05C55
1	Andrei Kotlov	Spectral Characterization of Tree-Width-Two Graphs.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05
1	Benoît Larose, Claude Tardif	Hedetniemi's Conjecture and the Retracts of a Product of Graphs.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C15, 08A40, 05C75

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