Search results for "05C35"

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