On the combinatorial problems which I would most like to see solved
From MaRDI portal
Publication:1164626
DOI10.1007/BF02579174zbMath0486.05001WikidataQ56390930 ScholiaQ56390930MaRDI QIDQ1164626
Publication date: 1981
Published in: Combinatorica (Search for Journal in Brave)
05-02: Research exposition (monographs, survey articles) pertaining to combinatorics
00A07: Problem books
11B75: Other combinatorial number theory
03E05: Other combinatorial set theory
05Cxx: Graph theory
05Bxx: Designs and configurations
Related Items
Regular pairs in sparse random graphs I, The edge-coloring-property for Steiner triple systems, THE LENGTH AND BETWEENNESS RELATIONS OF INDISTINGUISHABILITY OPERATORS, Measurable sets with excluded distances, Extension of certain combinatorial estimates with geometrical background, Transitive closure and betweenness relations, On the number of homogeneous subgraphs of a graph, Three-regular parts of four-regular graphs, On finite set-systems whose every intersection is a kernel of a star, On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry, The Ramsey number for a triple of long even cycles, A note on the probabilistic approach to Turan's problem, Cycles in graphs of uncountable chromatic number, On color critical graphs, Forbidding just one intersection, Regular subgraphs of dense graphs, All rationals occur as exponents, The maximum number of edges in a 3-graph not containing a given star, Exact solution of some Turán-type problems, Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász, A coloring problem related to the Erdős, Faber, Lovasz conjecture, Consistency results on infinite graphs, On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs, Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors, A fractional version of the Erdős-Faber-Lovász conjecture, On a problem of Erdős and Lovász: Random lines in a projective plane, On the number of circles determined by \(n\) points in the Euclidean plane, Unbalanced Steiner triple systems, A problem of Füredi and Seymour on covering intersecting families by pairs, Fractional v. integral covers in hypergraphs of bounded edge size, On a geometric combinatorial problem, Maximal intersecting families and affine regular polygons in \(PG(2,q)\), Regular subpseudographs of regular pseudographs, Matchings and covers in hypergraphs, Clique covers and coloring problems of graphs, Covers in hypergraphs, Nearly bipartite graphs with large chromatic number, A threshold for perfect matchings in random d-pure hypergraphs, On homogeneous sets of positive integers, What we know and what we do not know about Turán numbers, The Erdős-Faber-Lovász conjecture for dense hypergraphs, Forbidden Intersections
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On conjecture of Graffiti
- An ergodic Szemerédi theorem for commuting transformations
- Extremal problems and coverings of the space
- Induced subtrees in graphs of large chromatic number
- All Ramsey numbers for cycles in graphs
- On some problems of elementary and combinatorial geometry
- Hamiltonian circuits in random graphs
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Combinatorial properties of systems of sets
- Every planar map is four colorable. I: Discharging
- Combinatorial designs related to the strong perfect graph conjecture
- Extremal problems among subsets of a set
- Subgraphs of graphs. I
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Normal hypergraphs and the perfect graph conjecture
- Ramsey numbers for cycles in graphs
- On a Ramsey-type problem of J. A. Bondy and P. Erdős. I
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- On a valence problem in extremal graph theory
- On the existence of triangulated spheres in 3-graphs, and related problems
- On the Number of Ordinary Lines Determined by n Points
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Intersection Theorems for Systems of Sets
- The Existence and Construction of Balanced Incomplete Block Designs
- On sets of integers containing k elements in arithmetic progression
- Intersection theorems for systems of sets (III)
- Intersection Theorems for Systems of Sets
- Graph reconstruction—a survey
- On paul turán's influence on graph theory
- On families of finite sets no two of which intersect in a singleton
- An intersection problem for finite sets
- The Representation of a Graph by Set Intersections
- On chromatic number of graphs and set-systems
- On Graphs that do not Contain a Thomsen Graph
- A problem on well ordered sets
- On the existence of a factor of degree one of a connected random graph
- An extremal graph problem
- The realization of distances within sets in Euclidean space
- On an Extremum Problem in the Plane
- The Nonexistence of Certain Finite Projective Planes
- The Lines and Planes Connecting the Points of a Finite Set
- On a problem of K. Zarankiewicz
- On Certain Sets of Integers (II)
- The Asymptotic Number of Latin Rectangles
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
