Paul Erdös - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 100 from 216

2015

Egyptian Fractions with Each Denominator Having Three Distinct Prime DivisorsSteve Butler, Paul Erdös, Ron Graham. int, 15, 2015. [doi]

2013

Dense Difference Sets and Their Combinatorial StructureVitaly Bergelson, Paul Erdös, Neil Hindman, Tomasz Luczak. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős I. pages 133-146, Springer, 2013. [doi]

Some of My Favorite Problems and ResultsPaul Erdös. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős I. pages 51-70, Springer, 2013. [doi]

2006

Extremal problems among subsets of a setPaul Erdös, Daniel J. Kleitman. DM, 306(10-11):923-931, 2006. [doi]

On some applications of graph theory, IPaul Erdös, A. Meir, Vera T. Sós, P. Turán. DM, 306(10-11):853-866, 2006. [doi]

2003

On large intersecting subfamilies of uniform setfamiliesRichard A. Duke, Paul Erdös, Vojtech Rödl. rsa, 23(4):351-356, 2003. [doi]

On the equality of the partial Grundy and upper ochromatic numbers of graphsPaul Erdös, Stephen T. Hedetniemi, Renu Laskar, Geert C. E. Prins. DM, 272(1):53-64, 2003. [doi]

2002

A Ramsey-type problem and the Turán numbersNoga Alon, Paul Erdös, David S. Gunderson, Michael Molloy. jgt, 40(2):120-129, 2002. [doi]

Random induced graphsBéla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp. DM, 248(1-3):249-254, 2002. [doi]

2001

Edge disjoint monochromatic triangles in 2-colored graphsPaul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel. DM, 231(1-3):135-141, 2001. [doi]

1999

Extremal graphs for weightsBéla Bollobás, Paul Erdös, Amites Sarkar. DM, 200(1-3):5-19, 1999. [doi]

Graphs of diameter two with no 4-circuitsJohn Adrian Bondy, Paul Erdös, Siemion Fajtlowicz. DM, 200(1-3):21-25, 1999. [doi]

Sur les ensembles représentés par les partitions d un entier n:::1:::Marc Deléglise, Paul Erdös, Jean-Louis Nicolas. DM, 200(1-3):27-48, 1999. [doi]

On a question about sum-free sequencesJean-Marc Deshouillers, Paul Erdös, Giuseppe Melfi. DM, 200(1-3):49-54, 1999. [doi]

On the angular distribution of Gaussian integers with fixed normPaul Erdös, Richard Roxby Hall. DM, 200(1-3):87-94, 1999. [doi]

Subsets of an interval whose product is a powerPaul Erdös, Janice L. Malouf, J. L. Selfridge, Esther Szekeres. DM, 200(1-3):137-147, 1999. [doi]

Ensembles de multiples de suites finiesPaul Erdös, Gerald Tenenbaum. DM, 200(1-3):181-203, 1999. [doi]

The number of cycle lengths in graphs of given minimum degree and girthPaul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp. DM, 200(1-3):55-60, 1999. [doi]

Prime power divisors of binomial coefficientsPaul Erdös, Grigori Kolesnik. DM, 200(1-3):101-117, 1999. [doi]

Finding Large p-Colored Diameter Two SubgraphsPaul Erdös, Tom Fowler. gc, 15(1):21-27, 1999. [doi]

Induced subgraphs of given sizesPaul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós. DM, 200(1-3):61-77, 1999. [doi]

On arithmetic properties of integers with missing digits II: Prime factorsPaul Erdös, Christian Mauduit, András Sárközy. DM, 200(1-3):149-164, 1999. [doi]

Greedy algorithm, arithmetic progressions, subset sums and divisibilityPaul Erdös, Vsevolod F. Lev, Gerard Rauzy, Csaba Sándor, András Sárközy. DM, 200(1-3):119-135, 1999. [doi]

Split and balanced colorings of complete graphsPaul Erdös, András Gyárfás. DM, 200(1-3):79-86, 1999. [doi]

On the orders of directly indecomposable groupsPaul Erdös, Péter P. Pálfy. DM, 200(1-3):165-179, 1999. [doi]

Popular distances in 3-spacePaul Erdös, Gergely Harcos, János Pach. DM, 200(1-3):95-99, 1999. [doi]

1998

Graphs of Extremal WeightsBéla Bollobás, Paul Erdös. arscom, 50, 1998.

How to decrease the diameter of triangle-free graphsPaul Erdös, András Gyárfás, Miklós Ruszinkó. combinatorica, 18(4):493-501, 1998. [doi]

1997

New Ramsey Bounds from Cyclic Graphs of Prime OrderNeil J. Calkin, Paul Erdös, Craig A. Tovey. siamdm, 10(3):381-387, 1997. [doi]

A Class of Edge Critical 4-Chromatic GraphsGuantao Chen, Paul Erdös, András Gyárfás, Richard H. Schelp. gc, 13(2):139-146, 1997. [doi]

Intersection Statements for Systems of SetsWalter A. Deuber, Paul Erdös, David S. Gunderson, Alexandr V. Kostochka, A. G. Meyer. JCT, 79(1):118-132, 1997. [doi]

Some old and new problems in various branches of combinatoricsPaul Erdös. DM, 165-166:227-231, 1997. [doi]

Distinct distances in finite planar setsPaul Erdös, Peter C. Fishburn. DM, 175(1-3):97-132, 1997. [doi]

Some recent problems and results in graph theoryPaul Erdös. DM, 164(1-3):81-85, 1997. [doi]

Minimum Planar Sets with Maximum Equidistance CountsPaul Erdös, Peter C. Fishburn. comgeo, 7:207-218, 1997.

Covering a graph by complete bipartite graphsPaul Erdös, László Pyber. DM, 170(1-3):249-251, 1997. [doi]

On cycles in the coprime graph of integersPaul Erdös, Gábor N. Sárközy. combinatorics, 4(2), 1997. [doi]

A Variant of the Classical Ramsey ProblemPaul Erdös, András Gyárfás. combinatorica, 17(4):459-467, 1997.

The size of the largest bipartite subgraphsPaul Erdös, András Gyárfás, Yoshiharu Kohayakawa. DM, 177(1-3):267-271, 1997. [doi]

1996

k-saturated graphs with restrictions on the degreesNoga Alon, Paul Erdös, Ron Holzman, Michael Krivelevich. jgt, 23(1):1-20, 1996. [doi]

Proof of a Conjecture of Bollob s on Nested CyclesGuantao Chen, Paul Erdös, William Staton. JCT, 66(1):38-43, 1996. [doi]

Sizes of graphs with induced subgraphs of large maximum degreePaul Erdös, Talmage James Reid, Richard H. Schelp, William Staton. DM, 158(1-3):283-286, 1996. [doi]

Maximum planar sets that determine k distancesPaul Erdös, Peter C. Fishburn. DM, 160(1-3):115-125, 1996. [doi]

d-complete sequences of integersPaul Erdös, Mordechai Lewin. moc, 65(214):837-840, 1996.

Hypercube subgraphs with minimal detoursPaul Erdös, Peter Hamburger, Raymond E. Pippert, William D. Weakley. jgt, 23(2):119-128, 1996. [doi]

Ramsey-remainderPaul Erdös, Zsolt Tuza, Pavel Valtr. ejc, 17(6):519-532, 1996. [doi]

Covering and independence in triangle structuresPaul Erdös, Tibor Gallai, Zsolt Tuza. DM, 150(1-3):89-101, 1996. [doi]

Graphs in which each C::4:: spans K::4::Paul Erdös, András Gyárfás, Tomasz Luczak. DM, 154(1-3):263-268, 1996. [doi]

1995

Monochromatic and zero-sum sets of nondecreasing diameterArie Bialostocki, Paul Erdös, Hanno Lefmann. DM, 137(1-3):19-34, 1995. [doi]

Multiplicities of Interpoint Distances in Finite Planar SetsPaul Erdös, Peter C. Fishburn. DAM, 60(1-3):141-147, 1995. [doi]

Intervertex Distances in Convex PolygonsPaul Erdös, Peter C. Fishburn. DAM, 60(1-3):149-158, 1995. [doi]

Two Combinatorial Problems in the PlanePaul Erdös, George B. Purdy. dcg, 13:441-443, 1995.

Degree sequence and independence in K(4)-free graphsPaul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton. DM, 141(1-3):285-290, 1995. [doi]

On the Size of a Random Maximal GraphPaul Erdös, Stephen Suen, Peter Winkler. rsa, 6(2/3):309-318, 1995.

Extremal Graphs for Intersecting TrianglesPaul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson. JCT, 64(1):89-100, 1995. [doi]

On product representations of powers, IPaul Erdös, András Sárközy, Vera T. Sós. ejc, 16(6):567-588, 1995. [doi]

Covering of r-Graphs by Complete r-Partite SubgraphsPaul Erdös, Vojtech Rödl. rsa, 6(2/3):319-322, 1995.

1994

Crossing FamiliesBoris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman. combinatorica, 14(2):127-134, 1994.

A Postscript on Distances in Convex n-GonsPaul Erdös, Peter C. Fishburn. dcg, 11:111-117, 1994.

Extremal problems and generalized degreesPaul Erdös, Ralph J. Faudree, Cecil C. Rousseau. DM, 127(1-3):139-152, 1994. [doi]

Turán-Ramsey Theorems and K:::p:::-Independence NumbersPaul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi. cpc, 3:297-325, 1994.

A local density condition for trianglesPaul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp. DM, 127(1-3):153-161, 1994. [doi]

Problems and results in discrete mathematicsPaul Erdös. DM, 136(1-3):53-73, 1994. [doi]

Change of Leadership in a Random Graph ProcessPaul Erdös, Tomasz Luczak. rsa, 5(1):243-252, 1994.

On additive properties of general sequencesPaul Erdös, András Sárközy, Vera T. Sós. DM, 136(1-3):75-99, 1994. [doi]

Independet Transversals in Sparse Partite HypergraphsPaul Erdös, András Gyárfás, Tomasz Luczak. cpc, 3:293-296, 1994.

1993

Clique coverings of the edges of a random graphBéla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West. combinatorica, 13(1):1-5, 1993.

Ramsey Size Linear GraphsPaul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp. cpc, 2:389-399, 1993.

Turán-Ramsey theorems and simple asymptotically extremal structuresPaul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi. combinatorica, 13(1):31-56, 1993.

Clique Partitions of Chordal GraphsPaul Erdös, Edward T. Ordman, Yechezkel Zalcstein. cpc, 2:409-415, 1993.

Monochromatic infinite pathsPaul Erdös, Fred Galvin. DM, 113(1-3):59-70, 1993. [doi]

On graphical partitionsPaul Erdös, L. Bruce Richmond. combinatorica, 13(1):57-63, 1993.

The size Ramsey number of a complete bipartite graphPaul Erdös, Cecil C. Rousseau. DM, 113(1-3):259-262, 1993. [doi]

The Giant Component 1960-1993Paul Erdös. rsa, 4(3):231-232, 1993.

Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic SubgraphsPaul Erdös, Guantao Chen, Cecil C. Rousseau, Richard H. Schelp. ejc, 14(3):183-189, 1993. [doi]

The grid revistedPaul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa. DM, 111(1-3):189-196, 1993. [doi]

Nearly Equal Distances in the PlanePaul Erdös, Endre Makai, János Pach. cpc, 2:401-408, 1993.

1992

Diverse Homogeneous SetsAndreas Blass, Paul Erdös, Alan D. Taylor. JCT, 59(2):312-317, 1992.

Cycle-connected graphsRichard A. Duke, Paul Erdös, Vojtech Rödl. DM, 108(1-3):261-278, 1992. [doi]

Extremal problems involving vertices and edges on odd cyclesPaul Erdös, Ralph J. Faudree, Cecil C. Rousseau. DM, 101(1-3):23-31, 1992. [doi]

Bounds for arrays of dots with distinct slopes or lengthsPaul Erdös, Ronald L. Graham, Imre Z. Ruzsa, Herbert Taylor. combinatorica, 12(1):39-44, 1992.

In memory of Tibor GallaiPaul Erdös. combinatorica, 12(4):373-374, 1992.

Optimum Multiple Access Coding (D.B. Jevtić)Paul Erdös. siamrev, 34(2):309-310, 1992. [doi]

An Extremal ProblemPaul Erdös. siamrev, 34(2):308, 1992. [doi]

Arithmetic progressions in subset sumsPaul Erdös, András Sárközy. DM, 102(3):249-264, 1992. [doi]

Covering the cliques of a graph with verticesPaul Erdös, Tibor Gallai, Zsolt Tuza. DM, 108(1-3):279-289, 1992. [doi]

Distributed Loop Network with Minimum Transmission DelayPaul Erdös, D. Frank Hsu. TCS, 100(1):223-241, 1992.

1991

Crossing FamiliesBoris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman. compgeom 1991: 351-356 [doi]

Distinct Distances Determined By Subsets of a Point Set in SpaceDavid Avis, Paul Erdös, János Pach. comgeo, 1:1-11, 1991.

Matchings from a set below to a set abovePaul Erdös, Jean A. Larson. DM, 95(1-3):169-182, 1991. [doi]

Degree sequences in triangle-free graphsPaul Erdös, Siemion Fajtlowicz, William Staton. DM, 92(1-3):85-88, 1991. [doi]

Lopsided Lovász Local Lemma and Latin transversalsPaul Erdös, Joel Spencer. DAM, 30(2-3):151-154, 1991. [doi]

Some Ramsey-type theoremsPaul Erdös, Fred Galvin. DM, 87(3):261-269, 1991. [doi]

Some extremal results in cochromatic and dichromatic theoryPaul Erdös, John G. Gimbel, Dieter Kratsch. jgt, 15(6):579-585, 1991. [doi]

Midpoints of Diagonals of Convex ::::n::::-GONSPaul Erdös, Peter C. Fishburn, Zoltán Füredi. siamdm, 4(3):329-341, 1991.

The Dimension of Random Ordered SetsPaul Erdös, Henry A. Kierstead, William T. Trotter. rsa, 2(3):254-276, 1991.

Saturated r-uniform hypergraphsPaul Erdös, Zoltán Füredi, Zsolt Tuza. DM, 98(2):95-104, 1991. [doi]

Local constraints ensuring small representing setsPaul Erdös, András Hajnal, Zsolt Tuza. JCT, 58(1):78-84, 1991. [doi]

Vertex coverings by monochromatic cycles and treesPaul Erdös, András Gyárfás, László Pyber. JCT, 51(1):90-95, 1991. [doi]

1990

Quasi-progressions and descending wavesTom C. Brown, Paul Erdös, Allen R. Freedman. JCT, 53(1):81-95, 1990. [doi]

All Publications

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Paul Erdös'

Viewing Publication 1 - 100 from 216

2015

2013

2006

2003

2002

2001

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

All Publications

Filter by Year [-]OR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Paul Erdös'

Viewing Publication 1 - 100 from 216

2015

2013

2006

2003

2002

2001

1999

1998

1997

1996

1995

1994

1993

1992

1991

1990

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1