A generalization of Kneser graphs (Q2191979)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A generalization of Kneser graphs	scientific article

Statements

scholarly article

0 references

A generalization of Kneser graphs (English)

0 references

zbMATH Open document ID

0 references

10.1134/S0001434620030037

0 references

0 references

A. E. Kupriyanov

0 references

Andrei M. Raigorodskii

0 references

Mathematical Notes

0 references

publication date

26 June 2020

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

Kneser's conjecture

0 references

Kneser graphs

0 references

topological method

0 references

MaRDI profile type

MaRDI publication profile

0 references

Kneser's conjecture, chromatic number, and homotopy

0 references

Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler

0 references

Combinatorial Geometry and Coding Theory*

0 references

On the chromatic number of a random subgraph of the Kneser graph

0 references

On random subgraphs of Kneser graphs and their generalizations

0 references

Lovász' theorem on the chromatic number of spheres revisited

0 references

On random subgraphs of Kneser and Schrijver graphs

0 references

Random Kneser graphs and hypergraphs

0 references

Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs

0 references

On chromatic numbers of close-to-Kneser distance graphs

0 references

Intersection theorems with geometric consequences

0 references

Borsuk's problem and the chromatic numbers of some metric spaces

0 references

On the chromatic numbers of spheres in \(\mathbb R^n\)

0 references

On the colouring of spheres embedded in $ \mathbb R^n$

0 references

On lower bounds for the chromatic number of sphere

0 references

On the chromatic numbers of small-dimensional Euclidean spaces

0 references

On the chromatic numbers of low-dimensional spaces

0 references

On a bound in extremal combinatorics

0 references

New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs

0 references

Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles

0 references

On the number of edges in a uniform hypergraph with a range of permitted intersections

0 references

Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection

0 references

Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors

0 references

Intersection theorems for \(\{0,\pm1\}\)-vectors and \(s\)-cross-intersecting families

0 references

Families of vectors without Antipodal pairs

0 references

On the chromatic numbers of some distance graphs

0 references

Extremal problems in hypergraph colourings

0 references

INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

0 references

Diversity of uniform intersecting families

0 references

New inequalities for families without \(k\) pairwise disjoint members

0 references

Regular bipartite graphs and intersecting families

0 references

Counting Intersecting and Pairs of Cross-Intersecting Families

0 references

A size-sensitive inequality for cross-intersecting families

0 references

Uniform <i>s</i>-Cross-Intersecting Families

0 references

On the stability of the Erdős-Ko-Rado theorem

0 references

full work available at URL

https://doi.org/10.1134/s0001434620030037

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2191979

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2191979&oldid=37091145"