scientific article; zbMATH DE number 3523543
From MaRDI portal
Publication:4101818
zbMATH Open0335.05002MaRDI QIDQ4101818FDOQ4101818
Authors: P. Erdős 
Publication date: 1976
Title of this publication is not available (Why is that?)
Recommendations
Permutations, words, matrices (05A05) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Problem books (00A07) Graph theory (05Cxx) Designs and configurations (05Bxx)
Cited In (70)
- On the harmonious chromatic number of graphs
- Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs
- Nested cycles with no geometric crossings
- A short note on supersaturation for oddtown and eventown
- 10 problems for partitions of triangle-free graphs
- On the size of maximal binary codes with 2, 3, and 4 distances
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
- Cycles with many chords
- On chromatic indices of finite affine spaces
- The Spectrum of Triangle-Free Graphs
- Title not available (Why is that?)
- \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Linear trees in uniform hypergraphs
- Title not available (Why is that?)
- Dense induced bipartite subgraphs in triangle-free graphs
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
- Nested cycles with no geometric crossings
- Sparse halves in triangle-free graphs
- Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems
- Forbidding just one intersection
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite Delta-systems. II
- Research problems from the 5th Slovenian Conference (Bled, 2003)
- Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming
- More about sparse halves in triangle-free graphs
- Maximal intersecting families and affine regular polygons in \(PG(2,q)\)
- Exact stability for Turán’s Theorem
- Title not available (Why is that?)
- Exact solution of some Turán-type problems
- Title not available (Why is that?)
- Linear CNF formulas and satisfiability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Problems and results in combinatorial analysis and graph theory
- Disjoint pairs in set systems with restricted intersection
- On line colorings of finite projective spaces
- On embedding triangle-free graphs in unit spheres
- Non \(t\)-intersecting families of linear spaces over \(GF(q)\)
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Frankl-Rödl-type theorems for codes and permutations
- Hypergraphs without exponents
- Further results on Erdős–Faber–Lovász conjecture
- SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Chromatic index of simple hypergraphs
- Title not available (Why is that?)
- Turán numbers for disjoint paths
- Sparse halves in dense triangle-free graphs
- Integer sequences without singleton intersection
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Sparse halves in K4‐free graphs
- Forbidding just one intersection, for permutations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Progress of some problems in graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Making an H $H$‐free graph k $k$‐colorable
- K4$K_4$‐free graphs have sparse halves
- Combinatorial and graph-theoretical problems and augmenting technique
- Approximation by juntas in the symmetric group, and forbidden intersection problems
- On maximal intersecting families of finite sets
- The Erdős-Faber-Lovász conjecture for dense hypergraphs
- Title not available (Why is that?)
- A note on the Erdős--Farber--Lovász conjecture
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 Q4101818)
