On the combinatorial problems which I would most like to see solved
type: Item
instance of: scholarly article
title: On the combinatorial problems which I would most like to see solved
zbMATH Open document ID: 0486.05001
DOI: 10.1007/BF02579174
published in: Combinatorica
publication date: 1981-01-01T00:00:00Z
review text: I was asked to write a paper about the major unsolved problems in combinatorial mathematics. After some thought it seemed better to modify the title to a less pretentious one. Combinatorial mathematics has grown enormously and a genuine survey would have to include not only topics where I have no real competance but also topics about which I never seriously thought, E.G. algorithmic combinatorics, coding theory and matroid theory.
Mathematics Subject Classification ID: 05-02
Mathematics Subject Classification ID: 05Cxx
Mathematics Subject Classification ID: 05Bxx
Mathematics Subject Classification ID: 11B75
Mathematics Subject Classification ID: 03E05
Mathematics Subject Classification ID: 00A07
zbMATH DE Number: 3763931
zbMATH Keywords: problems
Wikidata QID: Q56390930
MaRDI profile type: Publication
cites work: Every planar map is four colorable. I: Discharging
cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
cites work: Q5668821
cites work: Ramsey numbers for cycles in graphs
cites work: Graph reconstruction—a survey
cites work: Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
cites work: On Graphs that do not Contain a Thomsen Graph
cites work: On the existence of triangulated spheres in 3-graphs, and related problems
cites work: The Nonexistence of Certain Finite Projective Planes
cites work: Q5808059
cites work: Q4044602
cites work: Subgraphs of graphs. I
cites work: Combinatorial designs related to the strong perfect graph conjecture
cites work: Q4769064
cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
cites work: On some problems of elementary and combinatorial geometry
cites work: On conjecture of Graffiti
cites work: The Representation of a Graph by Set Intersections
cites work: On chromatic number of graphs and set-systems
cites work: A problem on well ordered sets
cites work: The Asymptotic Number of Latin Rectangles
cites work: Extremal problems among subsets of a set
cites work: Intersection theorems for systems of sets (III)
cites work: Intersection Theorems for Systems of Sets
cites work: On the existence of a factor of degree one of a connected random graph
cites work: An extremal graph problem
cites work: On a valence problem in extremal graph theory
cites work: Combinatorial properties of systems of sets
cites work: On a Problem of Sidon in Additive Number Theory, and on some Related Problems
cites work: All Ramsey numbers for cycles in graphs
cites work: On families of finite sets no two of which intersect in a singleton
cites work: An intersection problem for finite sets
cites work: Extremal problems and coverings of the space
cites work: Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
cites work: An ergodic Szemerédi theorem for commuting transformations
cites work: Q5837979
cites work: The Existence and Construction of Balanced Incomplete Block Designs
cites work: On the Number of Ordinary Lines Determined by n Points
cites work: Q3050157
cites work: On a problem of K. Zarankiewicz
cites work: The realization of distances within sets in Euclidean space
cites work: Normal hypergraphs and the perfect graph conjecture
cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen
cites work: Q5539652
cites work: Hamiltonian circuits in random graphs
cites work: On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
cites work: On Certain Sets of Integers (II)
cites work: On paul turán's influence on graph theory
cites work: On an Extremum Problem in the Plane
cites work: On sets of integers containing k elements in arithmetic progression
cites work: Induced subtrees in graphs of large chromatic number
cites work: An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
cites work: Q3208683
cites work: The Lines and Planes Connecting the Points of a Finite Set
full work available at URL: https://doi.org/10.1007/bf02579174
OpenAlex ID: W2169821423
DBLP publication ID: journals/combinatorica/Erdos81
author: P. Erdős
description: scientific article; zbMATH DE number 3763931