On the combinatorial problems which I would most like to see solved

DOI10.1007/BF02579174zbMath0486.05001OpenAlexW2169821423WikidataQ56390930 ScholiaQ56390930MaRDI QIDQ1164626

No author found.

Publication date: 1981

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579174

zbMATH Keywords

problems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Problem books (00A07) Other combinatorial number theory (11B75) Other combinatorial set theory (03E05) Graph theory (05Cxx) Designs and configurations (05Bxx)

Related Items (only showing first 100 items - show all)

A Safe Computational Framework for Integer Programming Applied to Chvátal’s Conjecture ⋮ On the size-Ramsey number of grid graphs ⋮ Weakly saturated hypergraphs and a conjecture of Tuza ⋮ Random cliques in random graphs and sharp thresholds for F$$ F $$‐factors ⋮ The chromatic index of finite projective spaces ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ On Turán numbers for disconnected hypergraphs ⋮ Uniform Turán density of cycles ⋮ Monomial invariants applied to graph coloring ⋮ Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor ⋮ Coloring unions of nearly disjoint hypergraph cliques ⋮ Resolution of the Erdős–Sauer problem on regular subgraphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Unnamed Item ⋮ Measurable sets with excluded distances ⋮ Extension of certain combinatorial estimates with geometrical background ⋮ Transitive closure and betweenness relations ⋮ The Ramsey number of the clique and the hypercube ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ The Green-Tao Theorem and the Infinitude of Primes in Domains ⋮ On some three-color Ramsey numbers for paths ⋮ On homogeneous sets of positive integers ⋮ Regular subgraphs of dense graphs ⋮ All rationals occur as exponents ⋮ A problem of Füredi and Seymour on covering intersecting families by pairs ⋮ Unnamed Item ⋮ ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE ⋮ The maximum number of edges in a 3-graph not containing a given star ⋮ Pseudo sunflowers ⋮ Hilbert cubes in arithmetic sets ⋮ A note on fractional covers of a graph ⋮ What we know and what we do not know about Turán numbers ⋮ Fractional v. integral covers in hypergraphs of bounded edge size ⋮ Some extremal results on hypergraph Turán problems ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ Exact solution of some Turán-type problems ⋮ Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász ⋮ On sunflowers and matrix multiplication ⋮ The linear Turán number of small triple systems or why is the wicket interesting? ⋮ Coloring linear hypergraphs: the Erdős-Faber-Lovász conjecture and the combinatorial nullstellensatz ⋮ A coloring problem related to the Erdős, Faber, Lovasz conjecture ⋮ Consistency results on infinite graphs ⋮ Some remarks on the Zarankiewicz problem ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ On the size Ramsey number of all cycles versus a path ⋮ Note on the multicolour size-Ramsey number for paths ⋮ On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs ⋮ Perfect fractional matchings in \(k\)-out hypergraphs ⋮ On the Size-Ramsey Number of Tight Paths ⋮ The Ramsey number for a triple of long even cycles ⋮ Two extensions of Ramsey's theorem ⋮ The \(b\)-continuity of graphs with large girth ⋮ Small Dense Subgraphs of a Graph ⋮ The Erd\H{o}s--Faber--Lov\'{a}sz Conjecture revisited ⋮ On some Multicolor Ramsey Properties of Random Graphs ⋮ On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs ⋮ Nearly-linear monotone paths in edge-ordered graphs ⋮ The multicolour size-Ramsey number of powers of paths ⋮ An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths ⋮ \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture ⋮ Asymptotics for Shamir's problem ⋮ A bichromatic incidence bound and an application ⋮ Number on the forehead protocols yielding dense Ruzsa-Szemerédi graphs and hypergraphs ⋮ Restricted intersecting families on simplicial complex ⋮ Turán problems on non-uniform hypergraphs ⋮ Beck's theorem for plane curves ⋮ On transversals of quasialgebraic families of sets ⋮ The size Ramsey number of short subdivisions of bounded degree graphs ⋮ Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors ⋮ More on the extremal number of subdivisions ⋮ Further results on Erdős–Faber–Lovász conjecture ⋮ Lower bounds of size Ramsey number for graphs with small independence number ⋮ Ramsey Goodness of Clique Versus Paths in Random Graphs ⋮ The Erdős-Faber-Lovász conjecture for dense hypergraphs ⋮ A fractional version of the Erdős-Faber-Lovász conjecture ⋮ Size-Ramsey numbers of cycles versus a path ⋮ The size-Ramsey number of 3-uniform tight paths ⋮ On the rational Turán exponents conjecture ⋮ On a problem of Erdős and Lovász: Random lines in a projective plane ⋮ Forbidden Intersections ⋮ The edge-coloring-property for Steiner triple systems ⋮ Regular pairs in sparse random graphs I ⋮ Hypercubes defined on \(n\)-ary sets, the Erdös-Faber-Lovász conjecture on graph coloring, and the description spaces of polypeptides and RNA ⋮ The Ramsey numbers for a triple of long cycles ⋮ Note on sunflowers ⋮ The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs ⋮ Invitation to intersection problems for finite sets ⋮ A generalization of sets without long arithmetic progressions based on Szekeres algorithm ⋮ On line colorings of finite projective spaces ⋮ THE LENGTH AND BETWEENNESS RELATIONS OF INDISTINGUISHABILITY OPERATORS ⋮ Turán Numbers of Bipartite Subdivisions ⋮ Triangle-free subgraphs of hypergraphs ⋮ Maximal intersecting families and affine regular polygons in \(PG(2,q)\) ⋮ Regular subpseudographs of regular pseudographs ⋮ Matchings and covers in hypergraphs ⋮ Degenerate Turán densities of sparse hypergraphs ⋮ On chromatic indices of finite affine spaces

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

This page was built for publication: On the combinatorial problems which I would most like to see solved