scientific article; zbMATH DE number 3041944

zbMath0026.26903MaRDI QIDQ5781249

No author found.

Publication date: 1941

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

zbMATH Keywords

Topology

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

Nearly-Regular Hypergraphs and Saturation of Berge Stars ⋮ Making K_r+1-free graphs r-partite ⋮ The chromatic profile of locally colourable graphs ⋮ Stability for the Erdős-Rothschild problem ⋮ Tree densities in sparse graph classes ⋮ Unnamed Item ⋮ A generalization of a Turán’s theorem about maximum clique on graphs ⋮ Harary polynomials ⋮ Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation ⋮ The Forest Number of (n,m)-Graphs ⋮ Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth ⋮ ON A PROBLEM OF ERDŐS ABOUT GRAPHS WHOSE SIZE IS THE TURÁN NUMBER PLUS ONE ⋮ Counting independent sets in triangle-free graphs ⋮ Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors ⋮ The Turán number of the graph 3P5 ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier ⋮ New and improved results on the signed (total) k-domination number of graphs ⋮ Planar Turán Number of the 6-Cycle ⋮ An extremal graph problem ⋮ Hypergraph Turán densities can have arbitrarily large algebraic degree ⋮ Linear maps on nonnegative symmetric matrices preserving the independence number ⋮ Generalized Turán problems for double stars ⋮ A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ On a generalization of the spectral Mantel's theorem ⋮ The maximum number of triangles in \(F_k\)-free graphs ⋮ Turán and Ramsey numbers for 3‐uniform minimal paths of length 4 ⋮ Turán numbers for disjoint paths ⋮ Extremal graphs for odd wheels ⋮ On the maximum number of odd cycles in graphs without smaller odd cycles ⋮ Turán number of the family consisting of a blow-up of a cycle and a blow-up of a star ⋮ On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory ⋮ The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings ⋮ On Two Problems in Ramsey--Turán Theory ⋮ A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs ⋮ Refinement on Spectral Turán’s Theorem ⋮ Lagrangian-perfect hypergraphs ⋮ Optimizing diversity ⋮ The prime submodules hypergraph of a free module of finite rank over a commutative ring ⋮ THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE ⋮ Unnamed Item ⋮ The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tree decompositions of graphs without large bipartite holes ⋮ Unnamed Item ⋮ The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm ⋮ Provably Shorter Regular Expressions from Deterministic Finite Automata ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ A proof for a conjecture of Gorgol ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Extremal Graphs with Local Covering Conditions ⋮ Unnamed Item ⋮ Extremal non-bipartite regular graphs of girth 4 ⋮ The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs ⋮ The strongest facets of the acyclic subgraph polytope are unknown ⋮ Relative Turán Problems for Uniform Hypergraphs ⋮ Embedding complete trees into the hypercube ⋮ Unnamed Item ⋮ Lower bounds on the signed (total) $k$-domination number ⋮ Ramsey numbers for tournaments ⋮ Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille ⋮ Unnamed Item ⋮ Supersaturation problem for the bowtie ⋮ A median-type condition for graph tiling ⋮ A tighter relation between sensitivity complexity and certificate complexity ⋮ A priori optimization for the probabilistic maximum independent set problem ⋮ Local resilience of graphs ⋮ Simple and local independent set approximation ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\) ⋮ Some Motzkin-Straus type results for non-uniform hypergraphs ⋮ Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs ⋮ On clique values identities and mantel-type theorems ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Unnamed Item ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane ⋮ Metric dimension: from graphs to oriented graphs ⋮ Signed and Minus Dominating Functions in Graphs ⋮ Asymptotic Structure for the Clique Density Theorem ⋮ Short proofs of some extremal results III ⋮ Vertex Ramsey properties of randomly perturbed graphs ⋮ Codegree Thresholds for Covering 3-Uniform Hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge between Graphs and Alternating Matrix Spaces ⋮ Turán Graphs, Stability Number, and Fibonacci Index ⋮ All My Favorite Conjectures Are Critical ⋮ Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree ⋮ Graphs with coloring redundant edges ⋮ On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion ⋮ Lefschetz properties for Artinian Gorenstein algebras presented by quadrics ⋮ Maker-Breaker Games on Randomly Perturbed Graphs ⋮ Crossings Between Non-homotopic Edges ⋮ An Evans-Style Result for Block Designs ⋮ A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem ⋮ ?Best? estimations on the distribution of the length of sums of two random vectors ⋮ On the Stability of the Graph Independence Number ⋮ The clique number and the smallest \(Q\)-eigenvalue of graphs

This page was built for publication: