Pages that link to "Item:Q2189827"
From MaRDI portal
The following pages link to Independent sets, cliques, and colorings in graphons (Q2189827):
Displaying 14 items.
- Disjoint cliques and disjoint maximal independent sets of vertices in graphs (Q1168336) (← links)
- Fractional isomorphism of graphons (Q2095107) (← links)
- Tilings in graphons (Q2225467) (← links)
- Matching polytons (Q2278115) (← links)
- Independence number and packing coloring of generalized Mycielski graphs (Q2656330) (← links)
- On a question of Vera T. Sós about size forcing of graphons (Q2678384) (← links)
- Independent sets of \(m,n\)-gonal graphs (Q2826269) (← links)
- (Q3972310) (← links)
- Linear-sized independent sets in random cographs and increasing subsequences in separable permutations (Q5051470) (← links)
- Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs (Q5234663) (← links)
- On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
- Generalizing Körner's graph entropy to graphons (Q6080368) (← links)
- On the chromatic number in the stochastic block model (Q6115511) (← links)
- Increasing subsequences of linear size in random permutations and the Robinson-Schensted tableaux of permutons (Q6623576) (← links)