scientific article; zbMATH DE number 3523543

zbMath0335.05002MaRDI QIDQ4101818

No author found.

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05) Problem books (00A07) Graph theory (05Cxx) Designs and configurations (05Bxx)

Related Items (43)

Unnamed Item ⋮ Unnamed Item ⋮ Exact solution of some Turán-type problems ⋮ A note on the Erdős--Farber--Lovász conjecture ⋮ Approximation by juntas in the symmetric group, and forbidden intersection problems ⋮ Turán numbers for disjoint paths ⋮ Sparse halves in K4‐free graphs ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ On maximal intersecting families of finite sets ⋮ Making an H $H$‐free graph k $k$‐colorable ⋮ K4$K_4$‐free graphs have sparse halves ⋮ Integer sequences without singleton intersection ⋮ A short note on supersaturation for oddtown and eventown ⋮ The Spectrum of Triangle-Free Graphs ⋮ Lower bounds on circuit depth of the quantum approximate optimization algorithm ⋮ \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture ⋮ Forbidding just one intersection, for permutations ⋮ Non \(t\)-intersecting families of linear spaces over \(GF(q)\) ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Sparse halves in dense triangle-free graphs ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Further results on Erdős–Faber–Lovász conjecture ⋮ The Erdős-Faber-Lovász conjecture for dense hypergraphs ⋮ Dense induced bipartite subgraphs in triangle-free graphs ⋮ Chromatic index of simple hypergraphs ⋮ Disjoint pairs in set systems with restricted intersection ⋮ Sparse halves in triangle-free graphs ⋮ On finite Delta-systems. II ⋮ Linear trees in uniform hypergraphs ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ On embedding triangle-free graphs in unit spheres ⋮ On line colorings of finite projective spaces ⋮ Hypergraphs without exponents ⋮ Maximal intersecting families and affine regular polygons in \(PG(2,q)\) ⋮ More about sparse halves in triangle-free graphs ⋮ On chromatic indices of finite affine spaces ⋮ Linear CNF formulas and satisfiability ⋮ Frankl-Rödl-type theorems for codes and permutations ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs ⋮ Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming ⋮ Forbidding just one intersection ⋮ Exact stability for Turán’s Theorem ⋮ Nested cycles with no geometric crossings

This page was built for publication: