Pages that link to "Item:Q5379813"
From MaRDI portal
The following pages link to Komlós's tiling theorem via graphon covers (Q5379813):
Displaying 9 items.
- First steps in combinatorial optimization on graphons: matchings (Q1689941) (← links)
- Independent sets, cliques, and colorings in graphons (Q2189827) (← links)
- Relating the cut distance and the weak* topology for graphons (Q2222051) (← links)
- Tilings in graphons (Q2225467) (← links)
- Matching polytons (Q2278115) (← links)
- On a question of Vera T. Sós about size forcing of graphons (Q2678384) (← links)
- Linear-sized independent sets in random cographs and increasing subsequences in separable permutations (Q5051470) (← links)
- Triangles in randomly perturbed graphs (Q5885187) (← links)
- A median-type condition for graph tiling (Q5915833) (← links)
