Pages that link to "Item:Q1121290"
From MaRDI portal
The following pages link to Maximum bipartite subgraphs of Kneser graphs (Q1121290):
Displaying 14 items.
- \(L(1,1)\)-labelling of the direct product of a complete graph and a cycle (Q498455) (← links)
- The minimum number of disjoint pairs in set systems and related problems (Q524186) (← links)
- Häggkvist-Hell graphs: A class of Kneser-colorable graphs (Q764869) (← links)
- A note on induced cycles in Kneser graphs (Q1180426) (← links)
- Max-cut in circulant graphs (Q1201272) (← links)
- Long induced paths and cycles in Kneser graphs (Q1263600) (← links)
- Locally bipartite graphs (Q1813153) (← links)
- First-order complexity of subgraph isomorphism via Kneser graphs (Q2037624) (← links)
- Extensions of Fractional Precolorings Show Discontinuous Behavior (Q2930044) (← links)
- Fractional covering by cuts (Q3439381) (← links)
- (Q5202209) (← links)
- Large cycles in generalized Johnson graphs (Q6084722) (← links)
- Towards the Chen-Raspaud conjecture (Q6177406) (← links)
- The odd girth of generalized Johnson graphs (Q6542018) (← links)