Author:
Alon Noga,Krivelevich Michael,Sudakov Benny
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. A dense infinite Sidon sequence;Ajtai;European J. Combin.,1981
2. The strong chromatic number of a graph;Alon;Random Structures Algorithms,1992
3. N. Alon, M. Krivelevich, and, B. Sudakov, List coloring of random and pseudo-random graphs, Combinatorica, to appear.
4. The Probabilistic Method;Alon,1992
5. On coloring the nodes of a network;Brooks;Math. Proc. Cambridge Philos. Soc.,1941
Cited by
66 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On triangle-free list assignments;Discrete Mathematics;2024-02
2. A proof of the Erdős--Faber--Lovász conjecture;Annals of Mathematics;2023-09-01
3. Packing list‐colorings;Random Structures & Algorithms;2023-07-31
4. Uniformly Random Colourings of Sparse Graphs;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Colouring graphs with forbidden bipartite subgraphs;Combinatorics, Probability and Computing;2022-06-08