Pages that link to "Item:Q2192124"
From MaRDI portal
The following pages link to New bounds on clique-chromatic numbers of Johnson graphs (Q2192124):
Displaying 16 items.
- Chromatic numbers of distance graphs without short odd cycles in rational spaces (Q2037721) (← links)
- Lower bounds on the clique-chromatic numbers of some distance graphs (Q2043671) (← links)
- Bounds on Borsuk numbers in distance graphs of a special type (Q2044127) (← links)
- New Turán type bounds for Johnson graphs (Q2068827) (← links)
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\) (Q2113406) (← links)
- Coverings of planar and three-dimensional sets with subsets of smaller diameter (Q2166237) (← links)
- On the independence number and the chromatic number of generalized preferential attachment models (Q2197436) (← links)
- Exact modularity of line graphs of complete graphs (Q2229338) (← links)
- New lower bound on the modularity of Johnson graphs (Q2229339) (← links)
- On stability of the independence number of a certain distance graph (Q2229578) (← links)
- Estimate of the number of edges in subgraphs of a Johnson graph (Q2246879) (← links)
- Random cyclic triangle-free graphs of prime order (Q2666424) (← links)
- Covering planar sets (Q5919143) (← links)
- Interview with Andrei Raigorodskii (Q6097078) (← links)
- New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs (Q6604699) (← links)
- Decomposition of the Johnson graphs into graph-pairs of order 4 (Q6616802) (← links)
