{"publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ddc":["510"],"intvolume":"       199","corr_author":"1","doi":"10.1016/j.jcta.2023.105776","publication_identifier":{"eissn":["1096-0899"],"issn":["0097-3165"]},"year":"2023","article_type":"original","date_created":"2023-06-25T22:00:45Z","scopus_import":"1","publication_status":"published","article_processing_charge":"Yes (in subscription journal)","author":[{"first_name":"Lixing","full_name":"Fang, Lixing","last_name":"Fang"},{"first_name":"Hao","last_name":"Huang","full_name":"Huang, Hao"},{"last_name":"Pach","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","full_name":"Pach, János","first_name":"János"},{"full_name":"Tardos, Gábor","last_name":"Tardos","first_name":"Gábor"},{"full_name":"Zuo, Junchi","last_name":"Zuo","first_name":"Junchi"}],"citation":{"chicago":"Fang, Lixing, Hao Huang, János Pach, Gábor Tardos, and Junchi Zuo. “Successive Vertex Orderings of Fully Regular Graphs.” <i>Journal of Combinatorial Theory. Series A</i>. Elsevier, 2023. <a href=\"https://doi.org/10.1016/j.jcta.2023.105776\">https://doi.org/10.1016/j.jcta.2023.105776</a>.","ista":"Fang L, Huang H, Pach J, Tardos G, Zuo J. 2023. Successive vertex orderings of fully regular graphs. Journal of Combinatorial Theory. Series A. 199(10), 105776.","short":"L. Fang, H. Huang, J. Pach, G. Tardos, J. Zuo, Journal of Combinatorial Theory. Series A 199 (2023).","apa":"Fang, L., Huang, H., Pach, J., Tardos, G., &#38; Zuo, J. (2023). Successive vertex orderings of fully regular graphs. <i>Journal of Combinatorial Theory. Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jcta.2023.105776\">https://doi.org/10.1016/j.jcta.2023.105776</a>","ama":"Fang L, Huang H, Pach J, Tardos G, Zuo J. Successive vertex orderings of fully regular graphs. <i>Journal of Combinatorial Theory Series A</i>. 2023;199(10). doi:<a href=\"https://doi.org/10.1016/j.jcta.2023.105776\">10.1016/j.jcta.2023.105776</a>","ieee":"L. Fang, H. Huang, J. Pach, G. Tardos, and J. Zuo, “Successive vertex orderings of fully regular graphs,” <i>Journal of Combinatorial Theory. Series A</i>, vol. 199, no. 10. Elsevier, 2023.","mla":"Fang, Lixing, et al. “Successive Vertex Orderings of Fully Regular Graphs.” <i>Journal of Combinatorial Theory. Series A</i>, vol. 199, no. 10, 105776, Elsevier, 2023, doi:<a href=\"https://doi.org/10.1016/j.jcta.2023.105776\">10.1016/j.jcta.2023.105776</a>."},"language":[{"iso":"eng"}],"issue":"10","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"publication":"Journal of Combinatorial Theory. Series A","file":[{"file_name":"2023_JourCombinatiorialTheory_Fang.pdf","file_size":352555,"access_level":"open_access","content_type":"application/pdf","checksum":"9eebc213b4182a66063a99083ff5bd04","relation":"main_file","date_created":"2024-01-30T12:03:10Z","creator":"dernst","file_id":"14902","date_updated":"2024-01-30T12:03:10Z","success":1}],"type":"journal_article","external_id":{"arxiv":["2206.13592"]},"department":[{"_id":"HeEd"}],"title":"Successive vertex orderings of fully regular graphs","date_published":"2023-10-01T00:00:00Z","has_accepted_license":"1","oa_version":"Published Version","oa":1,"month":"10","quality_controlled":"1","arxiv":1,"file_date_updated":"2024-01-30T12:03:10Z","abstract":[{"text":"A graph G=(V, E) is called fully regular if for every independent set I c V, the number of vertices in V\\I  that are not connected to any element of I depends only on the size of I. A linear ordering of the vertices of G is called successive if for every i, the first i vertices induce a connected subgraph of G. We give an explicit formula for the number of successive vertex orderings of a fully regular graph.\r\nAs an application of our results, we give alternative proofs of two theorems of Stanley and Gao & Peng, determining the number of linear edge orderings of complete graphs and complete bipartite graphs, respectively, with the property that the first i edges induce a connected subgraph.\r\nAs another application, we give a simple product formula for the number of linear orderings of the hyperedges of a complete 3-partite 3-uniform hypergraph such that, for every i, the first i hyperedges induce a connected subgraph. We found similar formulas for complete (non-partite) 3-uniform hypergraphs and in another closely related case, but we managed to verify them only when the number of vertices is small.","lang":"eng"}],"date_updated":"2024-10-09T21:05:49Z","day":"01","article_number":"105776","volume":199,"_id":"13165"}