scientific article; zbMATH DE number 3668662
From MaRDI portal
Publication:3866151
zbMATH Open0429.05047MaRDI QIDQ3866151FDOQ3866151
Authors: P. Erdős 
Publication date: 1979
Title of this publication is not available (Why is that?)
Recommendations
- Some old and new problems in various branches of combinatorics
- scientific article; zbMATH DE number 4213989
- scientific article; zbMATH DE number 3754700
- scientific article; zbMATH DE number 3675978
- scientific article; zbMATH DE number 3285262
- scientific article; zbMATH DE number 4083638
- scientific article; zbMATH DE number 3895765
- A Selection of Problems and Results in Combinatorics
- scientific article; zbMATH DE number 3749050
- scientific article; zbMATH DE number 3116601
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Problem books (00A07) Designs and configurations (05B99) Elementary number theory (11A99)
Cited In (22)
- Old and new problems and results in combinatorial number theory: van der Waerden's theorem and related topics
- Independence in generic incidence structures
- Title not available (Why is that?)
- Embedding cycles in finite planes
- On an anti-Ramsey threshold for random graphs
- Intersection Problems in Extremal Combinatorics: Theorems, Techniques and Questions Old and New
- On an anti-Ramsey property of random graphs
- On Pappus configurations in Hall planes
- On universality of graphs with uniformly distributed edges
- Extremal problems in hypergraph colourings
- Regular behavior of the maximal hypergraph chromatic number
- A counting lemma for sparse pseudorandom hypergraphs
- On the density of subgraphs in a graph with bounded independence number
- Perfect graphs, kernels, and cores of cooperative games
- On graphs with unique geoodesics and antipodes
- Large Rainbow Cliques in Randomly Perturbed Dense Graphs
- Rainbow subgraphs in properly edge‐colored graphs
- On an anti‐Ramsey property of Ramanujan graphs
- On the Erdős-Hajnal problem for 3-graphs
- Anti-Ramsey threshold of cycles
- Counting results for sparse pseudorandom hypergraphs. I.
- Counting results for sparse pseudorandom hypergraphs. II.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3866151)
