Estimate of the number of edges in subgraphs of a Johnson graph
From MaRDI portal
Publication:2246879
DOI10.1134/S106456242104013XzbMath1478.05077OpenAlexW3200145084MaRDI QIDQ2246879
F. A. Pushnyakov, Andrei M. Raigorodskii
Publication date: 16 November 2021
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s106456242104013x
Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Related Items (6)
On Ramsey numbers for arbitrary sequences of graphs ⋮ On the minimal number of edges in induced subgraphs of special distance graphs ⋮ Two-colorings of normed spaces with no long monochromatic unit arithmetic progressions ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) ⋮ New Turán type bounds for Johnson graphs ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
- Unnamed Item
- Forbidding just one intersection
- On a Frankl-Wilson theorem
- Estimate of the number of edges in special subgraphs of a distance graph
- The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets
- New bounds on clique-chromatic numbers of Johnson graphs
- On the chromatic numbers corresponding to exponentially Ramsey sets
- On dividing sets into parts of smaller diameter
- Equitable colorings of hypergraphs with few edges
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
- On the weak chromatic number of random hypergraphs
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- Counterexamples to Borsuk's conjecture with large girth
- Panchromatic 3-colorings of random hypergraphs
- Almost intersecting families
- Regular Behavior of the Maximal Hypergraph Chromatic Number
- Extremal problems in hypergraph colourings
- Simple juntas for shifted families
- Ramsey theory in the -space with Chebyshev metric
- On the Ramsey numbers for complete distance graphs with vertices in $ \{0,1\}^n$
This page was built for publication: Estimate of the number of edges in subgraphs of a Johnson graph
