D. E. Daykin

1.2k total citations
81 papers, 695 citations indexed

About

D. E. Daykin is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, D. E. Daykin has authored 81 papers receiving a total of 695 indexed citations (citations by other indexed papers that have themselves been cited), including 33 papers in Computational Theory and Mathematics, 24 papers in Geometry and Topology and 13 papers in Discrete Mathematics and Combinatorics. Recurrent topics in D. E. Daykin's work include graph theory and CDMA systems (13 papers), Limits and Structures in Graph Theory (13 papers) and Mathematical Inequalities and Applications (10 papers). D. E. Daykin is often cited by papers focused on graph theory and CDMA systems (13 papers), Limits and Structures in Graph Theory (13 papers) and Mathematical Inequalities and Applications (10 papers). D. E. Daykin collaborates with scholars based in United Kingdom, Malaysia and United States. D. E. Daykin's co-authors include Rudolf Ahlswede, B. Bollobás, P. Erdös, Alan Brace, Roland Häggkvist, A. J. W. Hilton, Péter Frankl, C. J. Eliezer, W.F. Smyth and László Lovász and has published in prestigious journals such as Mathematics of Computation, American Mathematical Monthly and Theoretical Computer Science.

In The Last Decade

D. E. Daykin

73 papers receiving 615 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
D. E. Daykin United Kingdom	13	376	367	234	129	117	81	695
E. C. Milner Canada	12	438 1.2×	480 1.3×	320 1.4×	116 0.9×	24 0.2×	60	727
Imre Leader United Kingdom	15	385 1.0×	398 1.1×	309 1.3×	121 0.9×	79 0.7×	71	706
B. Bollobás United Kingdom	12	549 1.5×	573 1.6×	269 1.1×	153 1.2×	38 0.3×	17	758
Gregory A. Freiman Israel	12	266 0.7×	145 0.4×	143 0.6×	80 0.6×	37 0.3×	51	448
D. G. Larman United Kingdom	16	242 0.6×	350 1.0×	313 1.3×	64 0.5×	367 3.1×	65	927
J. L. Selfridge United States	15	256 0.7×	277 0.8×	280 1.2×	60 0.5×	46 0.4×	67	901
L. Bruce Richmond Canada	15	305 0.8×	185 0.5×	164 0.7×	29 0.2×	74 0.6×	55	602
Chao Ko Hungary	2	721 1.9×	514 1.4×	346 1.5×	198 1.5×	34 0.3×	2	825
Thomas Brylawski United States	10	220 0.6×	307 0.8×	158 0.7×	109 0.8×	19 0.2×	16	506
Peter M. Gibson United States	9	104 0.3×	230 0.6×	117 0.5×	160 1.2×	35 0.3×	38	387

Countries citing papers authored by D. E. Daykin

Since Specialization

Citations

This map shows the geographic impact of D. E. Daykin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by D. E. Daykin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites D. E. Daykin more than expected).

Fields of papers citing papers by D. E. Daykin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by D. E. Daykin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by D. E. Daykin. The network helps show where D. E. Daykin may publish in the future.

Co-authorship network of co-authors of D. E. Daykin

This figure shows the co-authorship network connecting the top 25 collaborators of D. E. Daykin. A scholar is included among the top collaborators of D. E. Daykin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with D. E. Daykin. D. E. Daykin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Daykin, D. E., et al.. (2012). A linear partitioning algorithm for Hybrid Lyndons usingV-order. Theoretical Computer Science. 483. 149–161. 7 indexed citations

Daykin, D. E., et al.. (2003). Lyndon-like and V-order factorizations of strings. Journal of Discrete Algorithms. 1(3-4). 357–365. 12 indexed citations

Daykin, D. E.. (2001). On deleting coordinates from integer vectors. Discrete Mathematics. 241(1-3). 201–206. 1 indexed citations

Daykin, D. E., et al.. (1994). The dual of the ahlswede-zhang identity. Journal of Combinatorial Theory Series A. 68(1). 246–249. 6 indexed citations

Daykin, D. E., et al.. (1984). On log concavity for order-preserving maps of partial orders. Discrete Mathematics. 50. 221–226. 9 indexed citations

Daykin, D. E., et al.. (1983). Pairings from down-sets and up-sets in distributive lattices. Journal of Combinatorial Theory Series A. 34(2). 215–230. 1 indexed citations

West, Douglas B., L. H. Harper, & D. E. Daykin. (1983). Some remarks on normalized matching. Journal of Combinatorial Theory Series A. 35(3). 301–308. 4 indexed citations

Daykin, D. E. & Péter Frankl. (1982). Sets of finite sets satisfying union conditions. Mathematika. 29(1). 128–134. 7 indexed citations

Daykin, D. E.. (1976). Graphs with cycles having adjacent lines different colors. Journal of Combinatorial Theory Series B. 20(2). 149–152. 16 indexed citations

10.

Brace, Alan & D. E. Daykin. (1974). Pseudo-matchings of a bipartite graph. Proceedings of the American Mathematical Society. 42(1). 28–32. 1 indexed citations

11.

Daykin, D. E.. (1974). Erdös-Ko-Rado from Kruskal-Katona. Journal of Combinatorial Theory Series A. 17(2). 254–255. 35 indexed citations

12.

Daykin, D. E., et al.. (1974). Existence theorems for Sperner families. Journal of Combinatorial Theory Series A. 17(2). 245–251. 31 indexed citations

13.

Daykin, D. E.. (1974). A simple proof of the Kruskal-Katona theorem. Journal of Combinatorial Theory Series A. 17(2). 252–253. 34 indexed citations

14.

Brace, Alan & D. E. Daykin. (1972). A finite set covering theorem II. Bulletin of the Australian Mathematical Society. 6(1). 19–24. 13 indexed citations

15.

Daykin, D. E., et al.. (1970). Factorization of Fibonacci Numbers. The Fibonacci quarterly. 8(1). 23–30. 2 indexed citations

16.

Daykin, D. E.. (1970). An Addition Algorithm for Greatest Common Divisor. The Fibonacci quarterly. 8(4). 347–349. 1 indexed citations

17.

Daykin, D. E. & C. J. Eliezer. (1968). Generalization of Hölder's and Minkowski's inequalities. Mathematical Proceedings of the Cambridge Philosophical Society. 64(4). 1023–1027. 4 indexed citations

18.

Daykin, D. E., et al.. (1967). Identities for Products of Fibonacci and Lucas Numbers. The Fibonacci quarterly. 5(4). 367–369.

19.

Daykin, D. E. & C. J. Eliezer. (1967). Generalizations of the A.M. and G.M. Inequality. Mathematics Magazine. 40(5). 247–247. 3 indexed citations

20.

Daykin, D. E. & K. W. Chang. (1965). On the stability of a second-order differential equation. Journal of the Australian Mathematical Society. 5(1). 8–16. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact