scientific article
From MaRDI portal
Publication:3337470
zbMath0546.05002MaRDI QIDQ3337470
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Permutations, words, matrices (05A05) Problem books (00A07) Other combinatorial number theory (11B75) Graph theory (05Cxx)
Related Items (48)
Subgraphs intersecting any Hamiltonian cycle ⋮ A note on bipartite subgraphs and triangle-independent sets ⋮ On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs ⋮ Minimal covers of \(S_ n\) by Abelian subgroups and maximal subsets of pairwise noncommuting elements ⋮ Pentagons in triangle-free graphs ⋮ Generalized planar Turán numbers ⋮ Vertex Turán problems for the oriented hypercube ⋮ A note on lower bounds for induced Ramsey numbers ⋮ Triangles in C5‐free graphs and hypergraphs of girth six ⋮ On the maximum number of odd cycles in graphs without smaller odd cycles ⋮ LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS ⋮ A note on the maximum number of triangles in a \(C_5\)-free graph ⋮ Stability version of Dirac's theorem and its applications for generalized Turán problems ⋮ Lower Bounds for Maximum Weighted Cut ⋮ Turán numbers of Berge trees ⋮ Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets ⋮ On the Number of Cycles in a Graph with Restricted Cycle Lengths ⋮ A Note on Induced Ramsey Numbers ⋮ Saturated Subgraphs of the Hypercube ⋮ The \(Q_2\)-free process in the hypercube ⋮ Strong forms of stability from flag algebra calculations ⋮ On even-cycle-free subgraphs of the hypercube ⋮ On even-cycle-free subgraphs of the hypercube ⋮ Efficient Testing without Efficient Regularity ⋮ \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups ⋮ Pentagons vs. triangles ⋮ On even-cycle-free subgraphs of the doubled Johnson graphs ⋮ Extremal even-cycle-free subgraphs of the complete transposition graphs ⋮ On 3-uniform hypergraphs without a cycle of a given length ⋮ Induced Ramsey-type theorems ⋮ A conjecture of Erdős on graph Ramsey numbers ⋮ Vertex Turán problems in the hypercube ⋮ The game of \(\mathcal F\)-saturator ⋮ On the maximum number of five-cycles in a triangle-free graph ⋮ On the inducibility of cycles ⋮ On the minimal degree condition of graphs implying equality of the largest \(K_r\)-free subgraphs and \((r - 1)\)-partite subgraphs ⋮ Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube ⋮ Maximizing five-cycles in \(K_r\)-free graphs ⋮ An efficient container lemma ⋮ Minimizing the number of 5-cycles in graphs with given edge-density ⋮ More about sparse halves in triangle-free graphs ⋮ Bounding the size of square-free subgraphs of the hypercube ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs ⋮ The vertex Turán density in 3-ary \(n\)-cubes ⋮ Some Turán type results on the hypercube ⋮ Hypercube 1-factorizations from extended Hamming codes ⋮ Generalized Turán densities in the hypercube ⋮ Inverse Turán numbers
This page was built for publication:
