{"id":"https://openalex.org/W2019194339","doi":"https://doi.org/10.1007/s00373-012-1281-9","title":"Maximum Hitting for n Sufficiently Large","display_name":"Maximum Hitting for n Sufficiently Large","publication_year":2013,"publication_date":"2013-01-15","ids":{"openalex":"https://openalex.org/W2019194339","doi":"https://doi.org/10.1007/s00373-012-1281-9","mag":"2019194339"},"language":"en","primary_location":{"id":"doi:10.1007/s00373-012-1281-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-012-1281-9","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research-information.bris.ac.uk/en/publications/94faaf34-d225-4d1c-b9f3-92a56efa36b5","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ben Barber","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ben Barber","raw_affiliation_strings":["Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, Wilberforce Road, Cambridge, CB3 0WB, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, Wilberforce Road, Cambridge, CB3 0WB, UK","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.10173281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":"2","first_page":"267","last_page":"274"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9567999839782715,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9567999839782715,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.004100000020116568,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0034000000450760126,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4934999942779541},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.45010000467300415},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.2953999936580658},{"id":"https://openalex.org/keywords/hitting-time","display_name":"Hitting time","score":0.29190000891685486},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.25119999051094055}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8206999897956848},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6913999915122986},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4934999942779541},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.45010000467300415},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.362199991941452},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2953999936580658},{"id":"https://openalex.org/C199277547","wikidata":"https://www.wikidata.org/wiki/Q5872687","display_name":"Hitting time","level":2,"score":0.29190000891685486},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2614000141620636},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.25119999051094055},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2370000034570694}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00373-012-1281-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00373-012-1281-9","pdf_url":null,"source":{"id":"https://openalex.org/S186126824","display_name":"Graphs and Combinatorics","issn_l":"0911-0119","issn":["0911-0119","1435-5914"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Graphs and Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/4ee26a31-be71-4008-9629-f2a752e06e37","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/4ee26a31-be71-4008-9629-f2a752e06e37","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Barber, B 2014, 'Maximum hitting for n sufficiently large', Graphs and Combinatorics, vol. 30, no. 2, pp. 267-274. https://doi.org/10.1007/s00373-012-1281-9","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/94faaf34-d225-4d1c-b9f3-92a56efa36b5","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/94faaf34-d225-4d1c-b9f3-92a56efa36b5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Barber, B 2014, 'Maximum Hitting for n Sufficiently Large', Graphs and Combinatorics, vol. 30, no. 2, pp. 267-274. https://doi.org/10.1007/s00373-012-1281-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1203.4188","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1203.4188","pdf_url":"https://arxiv.org/pdf/1203.4188","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/4ee26a31-be71-4008-9629-f2a752e06e37","is_oa":false,"landing_page_url":"http://www.mendeley.com/catalogue/maximum-hitting-n-sufficiently-large","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Barber, B 2014, 'Maximum hitting for n sufficiently large', Graphs and Combinatorics, vol. 30, no. 2, pp. 267-274. https://doi.org/10.1007/s00373-012-1281-9","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/94faaf34-d225-4d1c-b9f3-92a56efa36b5","is_oa":true,"landing_page_url":"https://hdl.handle.net/1983/94faaf34-d225-4d1c-b9f3-92a56efa36b5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Barber, B 2014, 'Maximum Hitting for n Sufficiently Large', Graphs and Combinatorics, vol. 30, no. 2, pp. 267-274. https://doi.org/10.1007/s00373-012-1281-9","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/94faaf34-d225-4d1c-b9f3-92a56efa36b5","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/94faaf34-d225-4d1c-b9f3-92a56efa36b5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Barber, B 2014, 'Maximum Hitting for n Sufficiently Large', Graphs and Combinatorics, vol. 30, no. 2, pp. 267-274. https://doi.org/10.1007/s00373-012-1281-9","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1987233725","https://openalex.org/W2019935404","https://openalex.org/W2134230490"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2016-06-24T00:00:00"}