Independent sets, cliques, and colorings in graphons
From MaRDI portal
Publication:2189827
DOI10.1016/j.ejc.2020.103108zbMath1442.05155arXiv1712.07367OpenAlexW2781377992MaRDI QIDQ2189827
Publication date: 16 June 2020
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.07367
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
Linear-sized independent sets in random cographs and increasing subsequences in separable permutations ⋮ On a question of Vera T. Sós about size forcing of graphons ⋮ Generalizing Körner's graph entropy to graphons ⋮ On the chromatic number in the stochastic block model ⋮ Tilings in graphons ⋮ Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs ⋮ Fractional isomorphism of graphons
Cites Work
- Unnamed Item
- Spectral bounds for the independence ratio and the chromatic number of an operator
- The strong perfect graph theorem
- Limits of dense graph sequences
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Geometric algorithms and combinatorial optimization
- Matching polytons
- The fractional chromatic number of infinite graphs
- Cliques in dense inhomogeneous random graphs
- Komlós's tiling theorem via graphon covers
This page was built for publication: Independent sets, cliques, and colorings in graphons