Search results for "05C35"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Lucile Denoeud	Transfer distance between partitions.	Adv. Data Analysis and Classification	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 03E02, 05A18, 05C12, 62G15, 62G30, 05C35, 05D99
1	Noga Alon, Asaf Shapira	A separation theorem in property testing.	Combinatorica	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05D99, 05C35, 68R05
1	Maria Chudnovsky, Paul D. Seymour, Blair Sullivan	Cycles in dense digraphs.	Combinatorica	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C20, 05C35, 05C38
1	Ori Einstein	Properties of intersecting families of ordered sets.	Combinatorica	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C35, 05E35, 06A07
1	Hemanshu Kaul, Alexandr V. Kostochka, Gexin Yu	On a graph packing conjecture by Bollobás, Eldridge and Catlin.	Combinatorica	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C35, 05C70
1	Oleg Pikhurko	An exact Turán result for the generalized triangle.	Combinatorica	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05D05, 05C35
1	Benny Sudakov, Jacques Verstraëte	Cycle lengths in sparse graphs.	Combinatorica	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C35, 05C38
1	Etienne Birmelé, John Adrian Bondy, Bruce A. Reed	The Erdös-Pósa Property For Long Circuits.	Combinatorica	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05C83, 05C38
1	Yonatan Bilu, Nathan Linial	Lifts, Discrepancy and Nearly Optimal Spectral Gap*.	Combinatorica	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C22, 05C35, 05C80, 05C50
1	Adrian Bondy, Jian Shen, Stéphan Thomassé, Carsten Thomassen	Density Conditions For Triangles In Multipartite Graphs.	Combinatorica	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35
1	Matthias Kriesell	Mader's Conjecture On Extremely Critical Graphs.	Combinatorica	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C40, 05C35, 05C75
1	Tomasz Luczak	On The Structure Of Triangle-Free Graphs Of Large Minimum Degree.	Combinatorica	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C75, 05C35
1	Dhruv Mubayi, Vojtech Rödl	Supersaturation For Ramsey-Turán Problems.	Combinatorica	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05D05, 05C65
1	Jianguo Qian	Induced Matching Extendable Graph Powers.	Graphs and Combinatorics	2006	DBLP DOI BibTeX RDF	AMS Subject Classifications 05C70 (05C35)
1	Richard P. Anstee, Attila Sali	Small Forbidden Configurations IV: The 3 Rowed Case.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05D05, 05C35, 05C65
1	József Balogh, Béla Bollobás	Unavoidable Traces Of Set Systems.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05D05, 05C65
1	Michael R. Capalbo	Explicit Bounded-Degree Unique-Neighbor Concentrators.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35
1	Peter Keevash, Benny Sudakov	On A Hypergraph Turán Problem Of Frankl.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05E35, 05D05, 05C65
1	Peter Keevash, Benny Sudakov	The Turán Number Of The Fano Plane.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C65, 05C35
1	Wolfgang Mader	Graphs With 3n-6 Edges Not Containing A Subdivision Of K5.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C83, 05C35
1	Sean McGuinness	Bonds Intersecting Cycles In A Graph.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C38, 05C35
1	Dhruv Mubayi, Jacques Verstraëte	Proof Of A Conjecture Of Erdös On Triangles In Set-Systems.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05D05, 05C65
1	Joseph Samuel Myers, Andrew Thomason	The Extremal Function For Noncomplete Minors.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C83, 05C35
1	Rom Pinchasi, Micha Sharir	On Graphs That Do Not Contain The Cube And Related Problems.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35
1	Benny Sudakov	A New Lower Bound For A Ramsey-Type Problem.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05D10, 05C55
1	Arne Hoffmann, Lutz Volkmann	Structural Remarks on Bipartite Graphs with Unique f-Factors.	Graphs and Combinatorics	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classificiation Primary 05C70, Secondary 05C35
1	Liming Xiong, Roman Kuzel	A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs.	Graphs and Combinatorics	2005	DBLP DOI BibTeX RDF	AMS Subject Classification (2000). 05C45, 05C35
1	Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian	On Shadows Of Intersecting Families.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05D05, 05C65
1	Rudolf Ahlswede, Levon H. Khachatrian	Katona's Intersection Theorem: Four Proofs.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05D05, 05C65
1	Reinhard Diestel, Christof Rempel	Dense Minors In Graphs Of Large Girth.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05C83
1	Alexandr V. Kostochka, Vojtech Rödl	On Graphs With Small Ramsey Numbers, II.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C55, 05C35
1	Daniela Kühn, Deryk Osthus	Induced Subdivisions In Ks, s-Free Graphs of Large Average Degree.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05D40
1	Daniela Kühn, Deryk Osthus	Complete Minors In Ks, s-Free Graphs.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C83, 05C35, 05D40
1	Daniela Kühn, Deryk Osthus	Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05D40
1	Wolfgang Mader	High Connectivity Keeping Sets In n-Connected Graphs.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C40, 05C35
1	Dhruv Mubayi	An Explicit Construction for a Ramsey Problem.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05D10, 05C55
1	Stephan Brandt	Note.	Combinatorica	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05C15, 05C75
1	Béla Csaba, Ali Shokoufandeh, Endre Szemerédi	Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three.	Combinatorica	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C35, 05C70
1	Deryk Osthus, Hans Jürgen Prömel, Anusch Taraz	For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?	Combinatorica	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C80, 05A16, 05C35
1	Michael R. Capalbo	Small Universal Graphs for Bounded-Degree Planar Graphs.	Combinatorica	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C35
1	András Gyárfás, Alice Hubenko, József Solymosi	Large Cliques in C4-Free Graphs.	Combinatorica	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C35
1	Juan José Montellano-Ballesteros, Victor Neumann-Lara	An Anti-Ramsey Theorem.	Combinatorica	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C35, 05C99
1	Hiroshi Nagamochi, Tibor Jordán, Yoshitaka Nakao, Toshihide Ibaraki	Convex Embeddings and Bisections of 3-Connected Graphs 1.	Combinatorica	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C40, 05C35
1	Carsten Thomassen	On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree.	Combinatorica	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 05C15, 05C35
1	Maria Axenovich, André Kündgen	On a Generalized Anti-Ramsey Problem.	Combinatorica	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C55, 05C35, 05D40
1	Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma	Vertex Covers by Edge Disjoint Cliques.	Combinatorica	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C80, 05C35
1	Stanislav Jendrol, Ingo Schiermeyer	On a Max-min Problem Concerning Weights of Edges.	Combinatorica	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C35
1	Alexandr V. Kostochka, Douglas R. Woodall	Density Conditions for Panchromatic Colourings of Hypergraphs.	Combinatorica	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C65, 05C35, 05C15
1	Wolfgang Mader	Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth.	Combinatorica	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C83, 05C35
1	Oleg Pikhurko	Size Ramsey Numbers of Stars Versus 3-chromatic Graphs.	Combinatorica	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C35
1	Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy	Efficient Testing of Large Graphs.	Combinatorica	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68R10, 05C35, 05C85
1	Dennis Eichhorn, Dhruv Mubayi	Edge-Coloring Cliques with Many Colors on Subcliques.	Combinatorica	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C35, 05D10, 05C55
1	Tao Jiang, Dhruv Mubayi	New Upper Bounds for a Canonical Ramsey Problem.	Combinatorica	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C35, 05C55
1	Mekkia Kouider	Neighborhoods and Covering Vertices by Cycles.	Combinatorica	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C38, 05C35, 05C70
1	Béla Bollobás, Alex D. Scott	Exact Bounds for Judicious Partitions of Graphs.	Combinatorica	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C35
1	Noga Alon	The Shannon Capacity of a Union.	Combinatorica	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C35, 94C15, 05D10
1	Paul Erdös, András Gyárfás, Miklós Ruszinkó	How to decrease the diameter of triangle-free graphs.	Combinatorica	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C12, 05C35
1	Yoshiharu Kohayakawa, Bernd Kreuter, Angelika Steger	An Extremal Problem For Random Graphs And The Number Of Graphs With Large Even-Girth.	Combinatorica	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05A16, 05C35, 05C38, 05C80
1	Yoshiharu Kohayakawa, Hans Jürgen Prömel, Vojtech Rödl	Induced Ramsey Numbers.	Combinatorica	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C55, 05C35, 05C80
1	Wolfgang Mader	3n - 5 Edges Do Force a Subdivision of K5.	Combinatorica	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C35, 05C10
1	Wolfgang Mader	Topological Subgraphs in Graphs of Large Girth.	Combinatorica	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C35
1	Dhruv Mubayi	Edge-Coloring Cliques with Three Colors on All 4-Cliques.	Combinatorica	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C35, 05D10, 05C55
1	Gerald W. Schuster	A Minimum Degree Result for Disjoint Cycles and Forests in Graphs.	Combinatorica	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C05, 05C35, 05C38
1	Hong Wang 0022	Vertex-Disjoint Triangles in Claw-Free Graphs with Minimum Degree at Least Three.	Combinatorica	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C35, 05C70