[{"@context":"http:\/\/schema.org\/","@type":"BlogPosting","@id":"https:\/\/wiki.edu.vn\/en\/wiki24\/italo-jose-dejter-wikipedia\/#BlogPosting","mainEntityOfPage":"https:\/\/wiki.edu.vn\/en\/wiki24\/italo-jose-dejter-wikipedia\/","headline":"Italo Jose Dejter – Wikipedia","name":"Italo Jose Dejter – Wikipedia","description":"Italo Jose Dejter (December 17, 1939) is an Argentine-born American mathematician, a retired professor of mathematics and computer science from","datePublished":"2021-06-16","dateModified":"2021-06-16","author":{"@type":"Person","@id":"https:\/\/wiki.edu.vn\/en\/wiki24\/author\/lordneo\/#Person","name":"lordneo","url":"https:\/\/wiki.edu.vn\/en\/wiki24\/author\/lordneo\/","image":{"@type":"ImageObject","@id":"https:\/\/secure.gravatar.com\/avatar\/c9645c498c9701c88b89b8537773dd7c?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/c9645c498c9701c88b89b8537773dd7c?s=96&d=mm&r=g","height":96,"width":96}},"publisher":{"@type":"Organization","name":"Enzyklop\u00e4die","logo":{"@type":"ImageObject","@id":"https:\/\/wiki.edu.vn\/wiki4\/wp-content\/uploads\/2023\/08\/download.jpg","url":"https:\/\/wiki.edu.vn\/wiki4\/wp-content\/uploads\/2023\/08\/download.jpg","width":600,"height":60}},"image":{"@type":"ImageObject","@id":"https:\/\/wikimedia.org\/api\/rest_v1\/media\/math\/render\/svg\/e7b3edab7022ca9e2976651bc59c489513ee9019","url":"https:\/\/wikimedia.org\/api\/rest_v1\/media\/math\/render\/svg\/e7b3edab7022ca9e2976651bc59c489513ee9019","height":"","width":""},"url":"https:\/\/wiki.edu.vn\/en\/wiki24\/italo-jose-dejter-wikipedia\/","wordCount":9753,"articleBody":"Italo Jose Dejter (December 17, 1939) is an Argentine-born American mathematician, a retired professor of mathematics and computer science from the University of Puerto Rico, (August 1984-February 2018) and a researcher in algebraic topology,differential topology, graph theory, coding theory and combinatorial designs.He obtained a Licentiate degree in mathematics from  University of Buenos Aires in 1967, arrived at Rutgers University in 1970 by means of a Guggenheim Fellowship and obtained a Ph.D. degree in mathematics in 1975 under the supervision of Professor Ted Petrie,[1] with support of the National Science Foundation. He was a professor at theFederal University of Santa Catarina, Brazil, from 1977 to 1984, with grants from the National Council for Scientific and Technological Development, (CNPq).Dejter has been a visiting scholar at a number of research institutions, including University of S\u00e3o Paulo, Instituto Nacional de Matem\u00e1tica Pura e Aplicada, Federal University of Rio Grande do Sul,University of Cambridge, National Autonomous University of Mexico,Simon Fraser University, University of Victoria, New York University, University of Illinois at Urbana\u2013Champaign, McMaster University, DIMACS, Autonomous University of Barcelona, Technical University of Denmark, Auburn University, Polytechnic University of Catalonia, Technical University of Madrid, Charles University, Ottawa University and Sim\u00f3n Bol\u00edvar University. The sections below describe the relevance of Dejter’s work in the research areas  mentioned in the first paragraph above, or in the adjacent box.Table of ContentsAlgebraic and differential topology[edit]Graph theory[edit]Erd\u0151s\u2013P\u00f3sa theorem and odd cycles[edit]Ljubljana graph in binary 7-cube[edit]Coxeter graph and Klein graph[edit]Kd-ultrahomogeneous configurations[edit]Hamiltonicity in graphs[edit]Coloring the arcs of biregular graphs[edit]Perfect dominating sets[edit]Efficient dominating sets[edit]Quasiperfect dominating sets[edit]Coding theory[edit]Invariants of perfect error-correcting codes[edit]Generalizing perfect Lee codes[edit]Total perfect codes[edit]Combinatorial designs[edit]References[edit]Algebraic and differential topology[edit]In 1971, Ted Petrie[2] conjectured that if X is a closed, smooth 2n-dimensional homotopy complex projective space that admits a nontrivial smooth action of the circle,and if a function h, mapping  X onto the 2n-dimensional complex projective space, is a homotopy equivalence, then h preserves the Pontrjagin classes. In 1975, Dejter[3] proved Petrie’s Conjecture for n=3,establishing this way that every closed, smooth, 6-dimensional homotopycomplex projective space must be the complex 3-dimensional projective space CP3. Dejter’s result is most relevant in view of Petrie’s exotic S1-actions on CP3,[4] (apart from the trivial S1-actions on CP3).Let G be a compact Lie group, let Y be a smooth G-manifold and let F a G-fibremap between G-vector bundles of the same dimension over Y which on eachG-fibre is proper and has degree one.  Petrie[2] also asked: What are necessary and sufficient conditions for the existence of a smooth G-map properly G-homotopic to F and transverse to the zero-section? Dejter[5] provided both types of conditions, which do not close to a necessary and sufficient condition due to a counterexample.[5]The main tool involved in establishing the results above by reducing differential-topology problems into algebraic-topology solutions is equivariant algebraic K-theory, where equivariance is understood with respect to the group given by the circle, i.e. the unit circle of the complex plane.Graph theory[edit]Erd\u0151s\u2013P\u00f3sa theorem and odd cycles[edit]In 1962, Paul Erd\u0151s and Lajos P\u00f3sa proved that for every positive integer k there exists a positive integer k’ such that for every graph G, either (i) G has k vertex-disjoint (long and\/or even) cycles or (ii) there exists a subset X of less than k’ vertices of G such that G  Xhas no (long and\/or even) cycles. This result, known today as the Erd\u0151s\u2013P\u00f3sa theorem, cannot be extended to odd cycles. In fact, in 1987 Dejter and V\u00edctor Neumann-Lara[6] showed that given an integer k > 0, there exists a graph G not possessing disjoint odd cycles such that the number of vertices of G whose removal destroys all odd cycles of G is higher than k.Ljubljana graph in binary 7-cube[edit]In 1993,[7]Brouwer, Dejter and Thomassen described an undirected, bipartite graph with 112 vertices and 168 edges,(semi-symmetric, that is edge-transitive but not vertex-transitive, cubic graph with diameter 8, radius 7, chromatic number 2, chromatic index 3, girth 10, with exactly 168 cycles of length 10 and 168 cycles of length 12), known since 2002 as the Ljubljana graph. They[7]  also established that the Dejter graph,[8] obtained by deleting a copyof the Hamming code of length 7 from the binary7-cube, admits a 3-factorization into two copies of the Ljubljana graph. See also.[9][10][11][12][13][14] Moreover, relations of this subject with square-blocking subsets and with perfect dominating sets (see  below) inhypercubes were addressed by Dejter et al. since 1991 in,[12][13][14] and .[9]In fact, two questions were answered in,[7] namely:(a) How many colors are needed for a coloring of the n-cube without monochromatic 4-cycles or 6-cycles? Brouwer, Dejter and Thomassen[7] showed that 4 colors suffice and thereby settle a problem of Erd\u0151s.[15](Independently found by F.R.K.Chung.[16] Improving on this, Marston Conder[17] in 1993 showed that for all n not less than 3 the edges of the n-cube can be 3-colored in such a way that there is no monochromatic 4-cycle or 6-cycle).(b) Which vertex-transitive induced subgraphs does a hypercube have? The Dejter graph mentioned above is 6-regular, vertex-transitive and, as suggested, its edges can be 2-colored so that the two resulting monochromatic subgraphs are isomorphic to the semi-symmetric Ljubljana graph of girth 10.In 1972, I. Z. Bouwer[18] attributed a graph with the mentioned properties of the Ljubljana graph to R. M. Foster.Coxeter graph and Klein graph[edit]In 2012, Dejter[19] showed that the 56-vertex Klein cubic graph F{56}B,[20] denoted here \u0393’, can be obtained from the 28-vertex Coxeter cubic graph \u0393 by zipping adequately the squares of the 24 7-cycles of \u0393 endowed with anorientation obtained by considering \u0393 as a C{displaystyle {mathcal {C}}}-ultrahomogeneous[21]digraph, where C{displaystyle {mathcal {C}}} is the collection formed both by the oriented 7-cycles and the 2-arcs that tightlyfasten those oriented 7-cycles in \u0393. In the process, it is seen that\u0393’ is a C’-ultrahomogeneous (undirected) graph, where C’ is the collection formed by both the 7-cycles and the 1-paths that tightly fasten those7-cycles in \u0393’. This yields an embedding of \u0393’ into a 3-torus T3 which forms the Klein map[22] of Coxeter notation (7,3)8. The dual graph of \u0393’ in T3 is thedistance-regular Klein quartic graph, with corresponding dual map of Coxeter notation (3,7)8. Other aspects of this work are also cited in the following pages:Bitangents of a quartic.Coxeter graph.Heawood graph.In 2010, Dejter [23] adapted the notion of C{displaystyle {mathcal {C}}}-ultrahomogeneous graph for digraphs, and presented a strongly connectedC\u21924{displaystyle {vec {C}}_{4}}-ultrahomogeneous oriented graph on 168 vertices and 126 pairwise arc-disjoint 4-cycles with regular indegree and outdegree 3 and no circuits of lengths 2 and 3 by altering a definition of the Coxeter graph via pencils of ordered lines of the Fano plane in which pencils were replaced by ordered pencils.The study of ultrahomogeneous graphs (respectively, digraphs) can betraced back to Sheehan,[24]Gardiner,[25] Ronse,[26]Cameron,[27] Gol’fand and Klin,[28] (respectively, Fra\u00efss\u00e9,[29] Lachlan and Woodrow,[30] Cherlin[31]). See also page 77 in Bondy and Murty.[32]Kd-ultrahomogeneous configurations[edit]Motivated in 2013[33]  by the study of connected Menger graphs [34] of self-dual 1-configurations (nd)1[35][36] expressible as Kd-ultrahomogeneous graphs, Dejter wondered for which values of n such graphs exist, as they would yield the most symmetrical, connected, edge-disjoint unions of n copies of Kd on n vertices in which the roles of vertices and copies of Kd areinterchangeable. For d=4, known values of n are: n=13,21[37][38][39] and n=42,[40] This reference, by Dejter in 2009, yields a graph G for which each isomorphism between two of the 42 copies of K4 or two of the 21 copies of K2,2,2 in G extends to an automorphism of G. While it would be of interest to determine the spectrum and multiplicities of the involved values of n, Dejter[33] contributes the value of n=102 via the Biggs-Smithassociation scheme (presented via sextets[41] mod 17), shown to control attachment of 102 (cuboctahedral) copies of the line graph of the 3-cube to the 102 (tetrahedral) copies of K4, these sharing each triangle with two copies of the cuboctahedral copies and guaranteeing that the distance 3-graph of the Biggs-Smith graph is the Menger graph of a self-dual 1-configuration (1024)1.This result[33] was obtained as an application of a transformation of distance-transitive graphs into C-UH graphs that yielded the above-mentioned paper[19] and also allowed to confront,[42] as digraphs, the Pappus graph to the Desargues graph.These applications as well as the reference [43] use the following definition.Given a family C of digraphs, a digraph G is said to beC-ultrahomogeneous if every isomorphism between two induced membersof C in G extends to an automorphism of G. In,[43] itis shown that exactly 7 distance-transitive cubic graphs among theexisting 12 possess a particular ultrahomogeneous property withrespect to oriented cycles realizing the girth that allows theconstruction of a related Cayley digraph with similarultrahomogeneous properties in which those oriented cycles appearminimally “pulled apart”, or “separated” and whose description istruly beautiful and insightful.Hamiltonicity in graphs[edit]In 1983, Dejter[44]  found that an equivalent condition for the existence of a Z4-Hamilton cycle on the graph of chessknight moves of the usual type (1,2),(resp(1,4)) on the 2nx2n-board is that n is odd larger than 2, (resp. 4). These results are cited by I. Parberry,[45][46] in relation to the algorithmic aspects of the knight’s tour problem.In 1985, Dejter[47] presented a construction technique for Hamilton cycles in the middle-levels graphs. The existence of such cycles had been conjectured by I. Havel in 1983.[48] and by M. Buck and D. Wiedemann in 1984,[49] (though B\u00e9la Bollob\u00e1s presented it to Dejter as a Paul Erd\u0151s’ conjecture in Jan. 1983) and established by T. M\u00fctze[50] in 2014. That technique was used by Dejter et al.[51][52][53][54][55][56]In 2014, Dejter[57] returned to this problem and established a canonical ordering of the vertices in a quotient graph (of each middle-levels graph under the action of a dihedral group) in one-to-one correspondence with an initial section of a system of numeration (present as sequence A239903 in the On-Line Encyclopedia of Integer Sequences by Neil Sloane)[58] composed by restricted growth strings[59][60] (with the k-th Catalan number[61] expressed by means of the string 10…0 with k “zeros” and a single “one”, as J. Arndt does in page 325 [60]) and related to Kierstead-Trotter lexical matching colors.[62] This system of numeration may apply to a dihedral-symmetric restricted version of the middle-levels conjecture.In 1988, Dejter[63] showed that for any positive integer n, all 2-covering graphs of the complete graph Kn on n verticescan be determined; in addition, he showed that among them there is only one graph that is connected and has a maximal automorphism group, which happens to be bipartite; Dejter also showed that an i-covering graph of Kn is hamiltonian, for i less than 4, and that properly minimal connected non-hamiltonian covering graphs of Kn are obtained which are 4-coveringsof Kn; also, non-hamiltonian connected 6-coverings of Knwere constructed in that work.Also in 1988, Dejter[64] showed that if k, n and q are integers such that if 0 {displaystyle {vec {C}}}4-ultrahomogeneous oriented graph”, Discrete Mathematics, (2010), 1389\u20131391.^ Sheehan J. “Smoothly embeddable subgraphs”, J.London Math. Soc., s2-9 (1974), 212\u2013218.^ , Gardiner  A.“Homogeneous graphs”, Journal of Combinatorial Theory, Series B, 20 (1976),94\u2013102.^ Ronse C. “On homogeneous graphs”, J. LondonMath. Soc., s2-17 (1978), 375\u2013379.^ Cameron P. J. “6-transitivegraphs”, J. Combin. Theory Ser. B 28 (1980), 168\u2013179.^ Gol’fand Ja. Ju.; Klin M. H. “On k-homogeneous graphs”, Algorithmic studies in combinatorics (Russian), 186 (1978), 76\u201385.^ Fra\u00efss\u00e9 R. “Sur l’extension aux relations de quelques proprietes des ordres”, Ann. Sci. Ecole Norm. Sup. 71 (1954),363\u2013388.^ A. H. Lachlan A. H.; Woodrow R.“Countable ultrahomogeneous undirected graphs”, Trans. Amer. Math. Soc. 262 (1980), 51\u201394.^ Cherlin G. L. “The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments”, Memoirs Amer. Math. Soc., vol. 131, number 612, Providence RI, January 1988.^ Bondy A.; Murty U.S.R.; Graph Theory, Springer-Verlag, 2008.^ a b c Dejter I. J. “On a K4-UH self-dual 1-configuration (10241, arXiv:1002.0588[math.CO].^ Coxeter H. S. M. “Self-dual configurations and regular graphs”, Bull. Amer. Math. Soc., 56(1950), 413-455; http:\/\/www.ams.org\/journals\/bull\/1950-56-05\/S0002-9904-1950-09407-5\/S0002-9904-1950-09407-5.pdf.^ Gropp, Harald (1994). “On symmetric spatial configurations”. Discrete Mathematics. 125 (1\u20133): 201\u2013209. doi:10.1016\/0012-365X(94)90161-9.^ Colbourn C. J.; Dinitz J. H. “The CRC Handbook of Combinatorial Designs”, CRC, 1996.^ Gr\u00fcnbaum B. “Configurations of Points and Lines”, Grad. Textsin Math. 103, Amer. Math. Soc, Providence R.I., 2009.^ Gr\u00fcnbaum  B.; Rigby J. F. “The real configuration (214)”, Jour. London Math. Soc., Sec. Ser. 41(2) (1990), 336\u2013346.^ Pisanski T.; Servatius B. “Configurations from a Graphical Viewpoint”, Birkh\u00e4user, 2013.^ Dejter I. J. “On a{K4,K2,2,2}-ultrahomogeneous graph”, AustralasianJournal of Combinatorics, 44 (2009), 63-76.^ Biggs N. L.; Hoare  M. J. “The sextet construction for cubic graphs”, Combinatorica, 3 (1983), 153-165.^ Dejter I. J. “Pappus-Desargues digraph confrontation”, Jour. Combin. Math. Combin. Comput”, to appear 2013, \tarXiv:0904.1096 [math.CO]^ a b Dejter I. J. “Orientingand separating distance-transitive graphs”, Ars MathematicaContemporanea, 5 (2012) 221-236^ I. J. Dejter “Equivalent conditions for Euler problem on Z4-Hamilton cycles”, Ars Combinatoria, 16B, (1983), 285-295^ “Knight’s Tours”. larc.unt.edu. Archived from the original on 2014-01-16.^ I. Parberry “An efficient algorithm for the Knight\ufffds tour problem”, Discrete Applied Mathematics, 73, (1997), 251-260^ Dejter I. J. “Hamilton cycles and quotients of bipartite graphs”, in Y. Alavi et al., eds., Graph Theory and its Appl. to Alg. and Comp. Sci., Wyley, 1985, 189-199.^ Havel I. “Semipaths in directed cubes”, in: M. Fiedler (Ed.), Graphs and other Combinatorial Topics, Teubner-Texte Math., Teubner, Leipzig, 1983, pp. 101\u2013108.^ Buck M. and Wiedemann D. “Gray codes with restricted density”, Discrete Math., 48 (1984), 163-\u2013171.^ M\u00fctze T. “Proof of the middle-levels conjecture”, Arxiv 1404-4442^ Dejter I. J. “Stratification for hamiltonicity”, Congressus Numeranium, 47 (1985) 265-272.^ Dejter I. J.; Quintana J. “Long cycles in revolving door graphs”, Congressus Numerantium, 60 (1987), 163-168.^ Dejter I. J.;  Cordova J; Quintana J. “Two Hamilton cycles in bipartite reflective Kneser graphs”, Discrete Math. 72 (1988) 63-70.^ Dejter I. J.; Quintana J. “On an extension of a conjecture of I. Havel”, in Y. Alavi et al. eds., Graph Theory, Combin. and Appl., J. Wiley 1991, vol I, 327-342.^ Dejter I. J.; Cedeno W.; Jauregui V. “Frucht diagrams, Boolean graphs and Hamilton cycles”, Scientia, Ser. A, Math. Sci., 5 (1992\/93) 21-37.^ Dejter I. J.; Cedeno W.; Jauregui V. “A note on F-diagrams, Boolean graphs and Hamilton cycles”, Discrete Math. 114 (1993), 131-135.^ Dejter I. J. “Ordering the Levels Lk and Lk+1 of B2k+1“.^ Sloane, N.\u00a0J.\u00a0A. (ed.). “Sequence A239903”. The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.^ Ruskey F. “Simple combinatorial Gray codes constructed by reversing sublists”, Lecture Notes in Computer Science, 762 (1993) 201-208.^ a b Arndt J., Matters Computational: Ideas, Algorithms, Source Code, Springer, 2011.^ Sloane, N.\u00a0J.\u00a0A. (ed.). “Sequence A000108”. The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.^ Kierstead  H. A.; Trotter W. T. “Explicit matchings in the middle two levels of the boolean lattice”, Order 5 (1988), 163-171.^ I. J. Dejter “Minimal hamiltonian and nonhamiltonian covering graphs of Kn“, Ars Combinatoria, 25-C, (1988), 63-71.^ I. J. Dejter “(1,2k)-Chessknight Hamilton cycles invariant under quarter turns”, Scientia, Ser. A, Math. Sci., 2 (1988), 39-51.^ I. J. Dejter “Quarter-turns and Hamilton cycles for annular chessknight graphs”, Scientia, Ser. A, Math. Sci., 4 (1990\/91), 21-29.^ I. J. Dejter and V. Neumann-Lara “Voltage graphs and Hamilton cycles”, in V.  Kulli ed., Advances in Graph Theory, Vishwa Int. Publ., Gulbarga, India, 1991, 141-153.^ J.L. Gross and T.W. Tucker “Topological Graph Theory” Wiley, New York (1987).^ I. J. Dejter “On Coloring the Arcs of Biregular Graphs”, Discrete Applied Mathematics 284 (2020) 489–498^ a b Weichsel P. “Dominating sets in n-cubes”, Jour. of Graph Theory, 18 (1994), 479-488^ Dejter. I. J.; Phelps K. T. “On perfect domination of binary cubes”,preprint.^ \u00d6sterg\u00e5rd P.; Weakley W. D. “Constructing covering codes with given automorphisms”, Des. Codes Cryptogr. 16 (1999), 65-73^ Dejter I. J.; Phelps K. T. “Ternary Hamming and Binary Perfect Covering Codes”, in: A. Barg and S.Litsyn, eds., Codes and Association Schemes, DIMACS Ser. Discrete Math. Theoret. Comput Sci. 56, Amer. Math. Soc., Providence, RI, 111–113″^ a b Dejter I. J.; Serra O. “Efficient dominating sets in Cayley graphs”, Discrete Appl. Math., 129 (2003), no. 2-3, 319-328.^ Akers S.B.; Krishnamurthy  B. “A group theoretic model for symmetric interconnection networks”, IEEE Trans. Comput., 38 (1989), 555-565.^ Arumugam S.; Kala R. “Domination Parameters of Star Graphs”, Ars Combinatoria, 44 (1996) 93-96^ Dejter I. J.; Tomaiconza O. “Nonexistence of Efficient Dominating Sets in the Cayley Graphs Generated by Transposition Trees of Diameter 3”, Discrete Appl. Math., 232 (2017), 116-124.^ Dejter I. J. “Stargraphs: threaded distance trees and E-sets”, J. Combin. Math.Combin. Comput. 77 (2011), 3-16.^ Dejter I. J.“Worst-case efficient dominating sets in digraphs”, Discrete AppliedMathematics, 161 (2013) 944\u2013952. First Online DOI 10.1016\/j.dam.2012.11.016^ Dejter I. J. “Quasiperfect domination in triangular lattices”,Discussiones Mathematicae Graph Theory, 29(1) (2009),179-198.^ Dejter I. J. “SQS-graphs of extended 1-perfectcodes”, Congressus Numerantium, 193 (2008), 175-194.^ Dejter I. J. “STS-Graphical invariant for perfect codes”, J.Combin. Math. Combin. Comput., 36 (2001), 65-82.^ Dejter I. J.; Delgado A. A. “STS-Graphs of perfect codes modkernel”, Discrete Mathematics, 253 (2005), 31-47.^ Vasil’ev Y. L. “On nongroupclose-packed codes”, Problem of Cybernetics, 8 (1962) 375-378 (inRussian).^ Hergert F,“The equivalence classes of the Vasil’ev codes of length 15”,Springer-Verlag Lecture Notes 969 (1982) 176-186.^ Rif\u00e0 J.;Basart J. M.; Huguet L. “On completely regular propelinear codes”AAECC (1988) 341-355^ Rif\u00e0 J.; Pujol J. “Translationinvariant propelinear codes, Transact. Info. Th., IEEE, 43(1997)590-598.^ a b c Araujo C; Dejter I. J.; Horak P.“generalization of Lee codes”, Designs, Codes and Cryptography,70 77-90 (2014).^ a b GolombS. W.; Welsh L. R. “Perfect codes in the Lee metric and the packingof polyominoes”, SIAM J. Applied Math. 18 (1970), 302-317.^ a b Horak, P.; AlBdaiwi, B.F“Diameter Perfect Lee Codes”, IEEE Transactions on InformationTheory 58-8 (2012), 5490-5499.^ a b Dejter I. J.; Delgado A. A.“Perfect domination in rectangular grid graphs”, J. Combin. Math.Combin. Comput., 70 (2009), 177-196.^ Klostermeyer W. F.; Goldwasser J. L. “Total PerfectCodes in Grid Graphs”, Bull. Inst. Comb. Appl., 46(2006)61-68.^ Dejter I. J. “Perfect domination in regular gridgraphs”, Austral. Jour. Combin., 42 (2008), 99-114^ Dejter I. J.; Araujo C. “Lattice-liketotal perfect codes”, Discussiones Mathematicae Graph Theory,34 (2014) 57\u201374,doi:10.7151\/dmgt.1715.^ Dejter I. J.; Rivera-Vega  P.I.; Rosa Alexander “Invariants for 2-factorizations and cycle systems”, J.Combin. Math. Combin. Comput., 16 (1994), 129-152.^ Dejter I. J.; Franek F.; Mendelsohn E.;Rosa Alexander “Triangles in 2-factorizations”, Journal of Graph Theory, 26(1997) 83-94.^ Dejter I. J.; Franek F.; Rosa Alexander “ACompletion conjecture for Kirkman triple systems”, UtilitasMathematica, 50 (1996) 97-102^ Dejter I. J.; Lindner C.C.; Rosa Alexander “The number of 4-cycles in 2-factorizations of Kn“, J.Combin. Math. Combin. Comput., 28 (1998), 101-112.^ Dejter I.J.; Pike D.; Rodger C. A. “The directed almost resolvableHamilton-Waterloo problem”, Australas. J. Combin., 18 (1998),201-208.^ Adams P. A., Billington E. J.; Lindner C. C.“The number of 4-cycles in 2-factorizations of K2n minus a1-factor}, Discrete Math., 220 (2000), no.1-3, 1-11.^ Dejter I. J.; Lindner C. C.; Rodger C. A.;Meszka M. “Almost resolvable 4-cycle systems”, J. Combin. Math.Combin. Comput., 63 (2007), 173-182.^ Horak P.; Dejter I. J. “Completing Latin squares: critical sets, II”, Jour. Combin. Des., 15 (2007), 177-83.^ Billington E.J.; Dejter I. J.;  Hoffman D. G.; Lindner C. C. “Almost resolvablemaximum packings of complete graphs with 4-cycles”, Graphs andCombinatorics, 27 (2011), no. 2, 161-170"},{"@context":"http:\/\/schema.org\/","@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"item":{"@id":"https:\/\/wiki.edu.vn\/en\/wiki24\/#breadcrumbitem","name":"Enzyklop\u00e4die"}},{"@type":"ListItem","position":2,"item":{"@id":"https:\/\/wiki.edu.vn\/en\/wiki24\/italo-jose-dejter-wikipedia\/#breadcrumbitem","name":"Italo Jose Dejter – Wikipedia"}}]}]