Pages that link to "Item:Q1057858"
From MaRDI portal
The following pages link to Extremal problems concerning Kneser-graphs (Q1057858):
Displaying 39 items.
- On extremal \(k\)-supereulerian graphs (Q383349) (← links)
- Shifts of the stable Kneser graphs and hom-idempotence (Q518173) (← links)
- Some good characterization results relating to the Kőnig-Egerváry theorem (Q623797) (← links)
- Extremal \(G\)-free induced subgraphs of Kneser graphs (Q725003) (← links)
- Extremal problems whose solutions are the blowups of the small Witt- designs (Q807640) (← links)
- Intersection theorems for multisets (Q896069) (← links)
- An extremal problem for sets with applications to graph theory (Q1066141) (← links)
- A note on induced cycles in Kneser graphs (Q1180426) (← links)
- Long induced paths and cycles in Kneser graphs (Q1263600) (← links)
- Weight functions on the Kneser graph and the solution of an intersection problem of Sali (Q1316646) (← links)
- Graph products and the chromatic difference sequence of vertex-transitive graphs (Q1584242) (← links)
- The multichromatic numbers of some Kneser graphs (Q1584256) (← links)
- An extremal problem concerning graphs not containing \(K_t\) and \(K_{t,n-t}\) (Q1584294) (← links)
- On the structure of large sum-free sets of integers (Q1618115) (← links)
- On a biased edge isoperimetric inequality for the discrete cube (Q1713503) (← links)
- Independence number of products of Kneser graphs (Q1727773) (← links)
- New inequalities for families without \(k\) pairwise disjoint members (Q1747778) (← links)
- Cross-intersecting families of finite sets (Q1903016) (← links)
- Tight bounds for Katona's shadow intersection theorem (Q2048364) (← links)
- Clique number of Xor products of Kneser graphs (Q2138983) (← links)
- Sharp bounds for the chromatic number of random Kneser graphs (Q2171013) (← links)
- A generalization of Kneser graphs (Q2191979) (← links)
- Shattered matchings in intersecting hypergraphs (Q2229336) (← links)
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs (Q2422241) (← links)
- Erdős-Ko-Rado theorems in certain semilattices (Q2441154) (← links)
- On the diameter of Kneser graphs (Q2581434) (← links)
- Extremal graphs for blow-ups of keyrings (Q2657053) (← links)
- On the boxicity of Kneser graphs and complements of line graphs (Q2689506) (← links)
- Compact representations of the intersection structure of families of finite sets (Q2706199) (← links)
- (Q3315539) (← links)
- Extremal sets of subsets satisfying conditions induced by a graph (Q3346368) (← links)
- The Chromatic Number of Kneser Hypergraphs (Q3743337) (← links)
- An extremal problem onKr-free graphs (Q3826591) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- (Q5092401) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- On the union of intersecting families (Q5222559) (← links)
- (Q5870293) (← links)
- Trivial colors in colorings of Kneser graphs (Q6197737) (← links)
