Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 25
Volume 25, Number 1, December 2004
- Eli Berger:
KKM-A Topological Approach For Trees. 1-18 - Christian Bey:
Polynomial Lym Inequalities. 19-38 - Tom Bohman
, Ron Holzman:
Linear Versus Hereditary Discrepancy. 39-47 - Daniela Kühn, Deryk Osthus:
Complete Minors In Ks, s-Free Graphs. 49-64 - Bojan Mohar:
Hajós Theorem For Colorings Of Edge-Weighted Graphs. 65-76 - Gábor N. Sárközy, Stanley M. Selkow:
An Extension Of The Ruzsa-Szemerédi Theorem. 77-84 - Carsten Thomassen:
Classification Of Locally 2-Connected Compact Metric Spaces. 85-103 - Rudolf Ahlswede, Levon H. Khachatrian:
Katona's Intersection Theorem: Four Proofs. 105-110 - Reinhard Diestel, Christof Rempel:
Dense Minors In Graphs Of Large Girth. 111-116 - Bruce A. Reed, Benny Sudakov:
List Colouring When The Chromatic Number Is Close To the Order Of The Graph. 117-123
Volume 25, Number 2, March 2005
- Noga Alon, Vojtech Rödl:
Sharp Bounds For Some Multicolor Ramsey Numbers. 125-141 - Maria Chudnovsky, Gérard Cornuéjols, Xinming Liu, Paul D. Seymour, Kristina Vuskovic:
Recognizing Berge Graphs. 143-186 - James F. Geelen, Satoru Iwata:
Matroid Matching Via Mixed Skew-Symmetric Matrices. 187-215 - Joe Kilian, Charles Rackoff, Erez Petrank:
Lower Bounds For Concurrent Zero Knowledge*. 217-249
Volume 25, Number 3, May 2005
- Joseph Cheriyan, Howard J. Karloff, Yuval Rabani:
Approximating Directed Multicuts. 251-269 - Arjeh M. Cohen, Hans Cuypers, Ralf Gramlich:
Local Recognition Of Non-Incident Point-Hyperplane Graphs. 271-296 - Alan M. Frieze, Nicholas C. Wormald:
Random k-Sat: A Tight Threshold For Moderately Growing k. 297-305 - Ben Green:
Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs. 307-326 - Ken-ichi Kawarabayashi, Bjarne Toft:
Any 7-Chromatic Graphs Has K7 Or K4, 4 As A Minor. 327-353 - Radhika Ramamurthi, Douglas B. West:
Hypergraph Extension Of The Alon-Tarsi List Coloring Theorem. 355-366 - Hong Wang:
Maximal Total Length Of k Disjoint Cycles In Bipartite Graphs. 367-377
Volume 25, Number 4, July 2005
- Michael R. Capalbo:
Explicit Bounded-Degree Unique-Neighbor Concentrators. 379-391 - Guojun Li, Ying Xu, Chuanping Chen, Zhenhong Liu:
On Connected [g, f +1]-Factors in Graphs. 393-405 - Nathan Linial, Eyal Rozenman:
Random Lifts Of Graphs: Perfekt Matchings. 407-424 - Wolfgang Mader:
Graphs With 3n-6 Edges Not Containing A Subdivision Of K5. 425-438 - Sean McGuinness:
Bonds Intersecting Cycles In A Graph. 439-450 - Sean McGuinness:
Circuits Through Cocircuits In A Graph With Extensions To Matroids. 451-463 - Leonard J. Schulman, Vijay V. Vazirani:
A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution. 465-486 - Benny Sudakov:
A New Lower Bound For A Ramsey-Type Problem. 487-498 - Jeong Han Kim, Jirí Matousek, Van H. Vu:
Discrepancy After Adding A Single Set. 499-501
Volume 25, Number 5, September 2005
- Richard P. Anstee, Attila Sali:
Small Forbidden Configurations IV: The 3 Rowed Case. 503-518 - Irit Dinur, Oded Regev, Clifford D. Smyth:
The Hardness of 3-Uniform Hypergraph Coloring. 519-535 - Ioana Dumitriu, Joel H. Spencer:
The Liar Game Over an Arbitrary Channel. 537-559 - Peter Keevash, Benny Sudakov:
The Turán Number Of The Fano Plane. 561-574 - Matthias Kriesell:
Closed Separator Sets. 575-598 - Dhruv Mubayi, Jacques Verstraëte:
Proof Of A Conjecture Of Erdös On Triangles In Set-Systems. 599-614 - Rom Pinchasi, Micha Sharir:
On Graphs That Do Not Contain The Cube And Related Problems. 615-623 - Claude Tardif:
The Fractional Chromatic Number Of The Categorical Product Of Graphs. 625-632
Volume 25, Number 6, December 2005
- József Balogh, Béla Bollobás:
Unavoidable Traces Of Set Systems. 633-643 - Itai Benjamini, Gady Kozma:
A Resistance Bound Via An Isoperimetric Inequality. 645-650 - Stavros Garoufalidis, Martin Loebl:
Random Walks And The Colored Jones Function. 651-671 - Peter Keevash, Benny Sudakov:
On A Hypergraph Turán Problem Of Frankl. 673-706 - Elchanan Mossel, Yuval Peres:
New Coins From Old: Computing With Unknown Bias. 707-724 - Joseph Samuel Myers, Andrew Thomason:
The Extremal Function For Noncomplete Minors. 725-753
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-19 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
